#include "artclass.h"
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = 512;
int s[3][N][N];
const int C1 = 30;
const int C = 16;
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
map < pii , int > M;
int n,m;
n = H;
m = W;
for (int i = 1;i <= n;++i)
for (int j = 1;j <= m;++j) {
s[0][i][j] = R[i - 1][j - 1];
s[1][i][j] = G[i - 1][j - 1];
s[2][i][j] = B[i - 1][j - 1];
}
vi cnt((256 + C - 1) / C);
for (int i = 1;i + C1 <= n + 1;++i)
for (int j = 1;j + C1 <= m + 1;++j) {
int min_red = 255;
int max_red = 0;
int min_green = 255;
int max_green = 0;
int min_blue = 255;
int max_blue = 0;
for (int ii = i;ii < i + C1;++ii)
for (int jj = j;jj < j + C1;++jj) {
smin(min_red,s[0][ii][jj]);
smax(max_red,s[0][ii][jj]);
smin(min_green,s[1][ii][jj]);
smax(max_green,s[1][ii][jj]);
smin(min_blue,s[2][ii][jj]);
smax(max_blue,s[2][ii][jj]);
}
int d1 = max_red - min_red;
int d2 = max_blue - min_blue;
int d3 = max_green - min_green;
for (int i = 0;i < (256 + C - 1) / C;++i) {
if (i * C <= d1 && d1 < i * C + C)
++cnt[i];
if (i * C <= d2 && d2 < i * C + C)
++cnt[i];
if (i * C <= d3 && d3 < i * C + C)
++cnt[i];
}
}
const int C3 = 5000;
const int C4 = 50000;
int sz = cnt.size();
if (cnt[(sz / 2)] + cnt[(sz / 2) + 1] + cnt[(sz / 2) - 1] >= C4)
return 2;
if (cnt[0] + cnt[1] + cnt[2] <= C3)
return 3;
if (cnt[(3 * sz / 4)] + cnt[(3 * sz / 4) + 1] + cnt[(3 * sz / 4) + 2] + cnt[(3 * sz / 4) + 3] >= C4)
return 1;
return 4;
}
