Each vertex of C5□C5 initially knows a unique rumor. In one synchronous round, the edges of any matching may be used for calls, and callers exchange everything they know. Determine the minimum number of rounds until every vertex knows all 25 rumors.