public class Communities {

  // Data: friends[i][j] == 1 if i is friend of j. Assume that
  // friends[j][i] == 1 too.
  
  static int findNumCommunities (int[][] friends)
  {
    // INSERT YOUR CODE HERE.
      return -1;
  }


  //----------------------------------------------------------------
  // Test code ...
  

  public static void main (String[] argv) 
  {
    int[][] A1 = {
      {0, 0, 1, 0, 1},
      {0, 0, 0, 1, 0},
      {1, 0, 0, 0, 1},
      {0, 1, 0, 0, 0},
      {1, 0, 1, 0, 0}
    };
    int n = findNumCommunities (A1);
    System.out.println ("Test 1: 2 communities, your answer: " + n);

    int[][] A2 = {
      {0, 0, 1, 1, 1},
      {0, 0, 0, 1, 0},
      {1, 0, 0, 0, 1},
      {1, 1, 0, 0, 1},
      {1, 0, 1, 1, 0}
    };
    n = findNumCommunities (A2);
    System.out.println ("Test 2: 1 community, your answer: " + n);

  }

}