We present a simple rule which could generate scale-free networks with very large clustering coefficient and very small average distance. These networks, called the multistage random growing networks (MRGNs), are constructed by a two-stage adding process for each new node. The analytic results of the power-law exponentγ = 3 and the clustering coefficient C = 0.81 are obtained, which agree with the simulation results approximately.