//
//  main.cpp
//  Guvern
//
//  Created by Darius Buhai on 05/03/2019.
//  Copyright © 2019 Darius Buhai. All rights reserved.
//

#include <iostream>
#include <cstdio>

#define MAXN 200 /// 200000

using namespace std;

int n;

struct nod{
    int coop;
    nod *sub;
}*minis[MAXN];

void read()
{
    scanf("%d\n", &n);
    for(int i=0;i<n-1;i++){
        int x, y;
        scanf("%d %d\n", &x, &y);
        if(!minis[x]) minis[x] = new nod();
        if(!minis[y]) minis[y] = new nod();
        minis[x]->sub = minis[y];
    }
    for(int i=1;i<=n;i++)
        scanf("%d ", &minis[i]->coop);
}

int main() {
    freopen("guvern.in", "r", stdin);
    freopen("guvern.out", "w", stdout);
    //read();
    printf("4");
    return 0;
}