#include <bits/stdc++.h>
using namespace std;
#define ll int
#define vl vector<ll>
#define vb vector<bool>
#define pb push_back
#define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++)
#define pll pair<ll, ll>
#define fi first
#define se second
#define ed "\n"
#define all(aaa) aaa.begin(), aaa.end()
#define rall(aaa) aaa.rbegin(), aaa.rend()
ll MOD = 1e9+7;
vector<vl> R, G, B;
ll calc(ll i, ll j, ll k, ll l){
return abs(R[i][j] - R[k][l])+abs(G[i][j] - G[k][l])+abs(B[i][j] - B[k][l]);
}
ll style(ll H, ll W, ll r[500][500], ll g[500][500], ll b[500][500]){
R = vector<vl>(500, vl(500));
G = vector<vl>(500, vl(500));
B = vector<vl>(500, vl(500));
ff(i, 0, H){
ff(j, 0, W){
R[i][j] = r[i][j];
}
}
ff(i, 0, H){
ff(j, 0, W){
G[i][j] = g[i][j];
}
}
ff(i, 0, H){
ff(j, 0, W){
B[i][j] = b[i][j];
}
}
ll res = 0, c = 0;
ff(i, 0, H){
ff(j, 0, W-1){
res += calc(i, j, i, j+1);
c++;
}
}
ff(j, 0, W){
ff(i, 0, H-1){
res += calc(i, j, i+1, j);
c++;
}
}
res /= c;
if(res < 10) return 4;
else if(res < 27) return 1;
else if(res < 55) return 2;
else return 3;
}
/*
int main(){
ll h, w;
cin >> h >> w;
ll r[500][500], g[500][500], b[500][500];
ff(i, 0, h){
ff(j, 0, w){
cin >> r[i][j] >> g[i][j] >> b[i][j];
}
}
cout << style(h, w, r, g, b);
}
*/
