#include <bits/stdc++.h>
using namespace std;

#define ffor(i,o,f)		   for(int i = o; i < f; i++)
#define pb 				   push_back
#define mp                 make_pair
#define all(a)             (a).begin(), (a).end()
#define F                  first
#define S                  second
#define PI 				   3.14159265358979323846264338327950
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl 			   '\n'
#define sz(x)              ((int)(x).size())
typedef long long          ll;
typedef pair < int, int >  pii;
typedef vector < int >     vi;
typedef vector < pii >     vii;
typedef vector < vi > 	   gi;
typedef vector < ll >      vll;
typedef map < int, int >   mii;

int t, n, m, u, v, groups;
const int tam = 1005;
int mat[tam][tam];
unordered_set < int > vis;

void dfs(int nd){
    vis.insert(nd);
    ffor(i, 0, tam){
        if(mat[nd][i] && vis.find(i) == vis.end()){
            dfs(i);
        }
    }
}

int main()
{
    mat[0][2] = mat[2][0] = 1;
    mat[0][3] = mat[3][0] = 1;
    mat[1][3] = mat[3][1] = 1;
    mat[1][6] = mat[6][1] = 1;
    mat[2][3] = mat[3][2] = 1;
    mat[2][4] = mat[4][2] = 1;
    mat[2][5] = mat[5][2] = 1;
    mat[4][5] = mat[5][4] = 1;
    mat[3][7] = mat[7][3] = 1;
    mat[6][7] = mat[7][6] = 1;

    dfs(0);
}