using System;

public class Program

{

    static int[,] g = new int[8,8] {

                              {1,1,0,1,1,1,1,1},

                              {1,1,1,0,1,1,1,1},

                              {0,0,0,0,1,1,1,1},

                              {1,1,0,0,1,1,1,1},

                              {1,1,0,1,1,1,1,1},

                              {1,1,1,0,1,1,1,1},

                              {0,0,0,0,1,1,1,1},

                              {1,1,0,0,1,1,1,1}};

    static int[,] w = new int[8, 8];

​

    static int[] dx = new int[8] {-1,0,1,1,1,0,-1,-1};

    static int[] dy = new int[8] {1,1,1,0,-1,-1,-1,0};

​

    static void dfs(int x,int y,int c)

    {

        w[x,y] = c;

        for(int i=0; i<8;i++)

        {

            int nx = x+dx[i];

            int ny = y+dy[i];

​

            if(g[nx,ny] != w[nx,ny])

                dfs(nx,ny,c);

        }

    }

​

    public static void Main()

    {

        int row = 8;

        int col = 8;

        int set = 1;

​

    for(int i=1; i<=row;i++)

        for(int j=1; j<=col; j++)

    {

        if(g[i,j] != w[i,j])

                dfs(i,j,set++);

    }

/*

    for(int i=1; i<=4;i++){

        for(int j=1; j<=4;j++)

            printf("%d ", g[i][j]);

        puts("");

    }

    puts("");

    printf("Output:\n");

    for(int i=1; i<=row;i++){

        for(int j=1; j<=col;j++)

            printf("%d ", w[i][j]);

        puts("");

    }

*/

    }

}