Problem #PRU-100342

Problem

There are $n$ inhabitants ($n>3$) in the Wonderland. Each habitant has a secret, which is known to him/her only. In a telephone conversation two inhabitants tell each other all the secrets they know. Show that after $(2n-4)$ conversations all the secrets may be spread among all the inhabitants.