In this paper we study the consensus problem of SISO (Single-Input Single-Output) linear multi-agent systems under a fixed weighted undirected network communication. The dynamics of each agent can be of any order, while it is constrained to be neutrally stable. Based on a simple root locus argument, we show that the problem at hand is always solvable if the gain and zeros of the dynamic compensator, of which dimension is the same as the number of plant poles on the imaginary axis, are chosen suitably, finally the result is successfully verified by an example.