#include "artclass.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 112;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;
set < pair < int, pii > > q;
int style(int h, int w, int r[500][500], int g[500][500], int b[500][500]) {
int sumr = 0, sumg = 0, sumb = 0;
for (int i = 0; i < h; ++i)
for (int j = 0; j < w; ++j) {
sumr += r[i][j];
sumg += g[i][j];
sumb += b[i][j];
q.insert(mp(r[i][j], mp(b[i][j], g[i][j])));
}
bool ok = 1;
for (int j = 0; j < w; ++j) {
int R = r[0][j], G = g[0][j], B = b[0][j], cnt = 0;
for (int i = 0; i < h; ++i) {
if (abs(R - r[i][j]) > 40 || abs(G - g[i][j]) > 40 || abs(B - b[i][j]) > 50)
++cnt;
R = r[i][j];
G = g[i][j];
B = b[i][j];
}
if (cnt > 7) {
cerr << j << ' ' << cnt << endl;
ok = 0;
break;
}
}
if (ok)
return 4;
// cout << (sumr + 0.0) / (h*w) << endl;
// cout << (sumg + 0.0) / (h*w) << endl;
// cout << (sumb + 0.0) / (h*w) << endl;
// cout << (sz(q) + 0.0) / (h*w) << endl;
return 1;
}
