Communication complexity in a 3-computer model

It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).