SAGDA: Achieving O (null 2) Communication Complexity in Federated Min-Max Learning