Gossiping old ladies

We consider the following problem: there are n ladies each knowing a gossip. Anybody can speak to anybody and they tell the other all of the gossips they know at that time. Is it possible to give a sequence of conversations when everybody hears each gossip exactly once? We determine all of the n's for which this is feasible.

[1]  Brenda S. Baker,et al.  Gossips and telephones , 1972, Discret. Math..

[2]  E. C. Milner,et al.  A Cure for the Telephone Disease , 1972, Canadian Mathematical Bulletin.

[3]  R. Bumby.  A Problem with Telephones , 1981 .