#include "artclass.h"
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#include <string>
#include <cassert>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define INF 1005141919
#define _1 first
#define _2 second
int style(int H, int W, int R[500][500], int G[500][500], int B[500][500]) {
int sum = 0, sum_green = 0;
rep(y, H) rep(x, W) {
sum += R[y][x];
sum += G[y][x];
sum += B[y][x];
sum_green += G[y][x];
}
sum/=W*H;
sum/=3;
sum_green/=W*H;
int w = W/20, h = H/20;
int mindiff = 255;
rep(lx, W-w) rep(ly, H-h) {
int lr = 255, rr = 0;
int lg = 255, rg = 0;
int lb = 255, rb = 0;
for (int x=lx; x<=lx+w; x++) {
for (int y=ly; y<=ly+h; y++) {
lr = min(lr, R[y][x]);
rr = max(rr, R[y][x]);
lg = min(lg, G[y][x]);
rg = max(rg, G[y][x]);
lb = min(lb, B[y][x]);
rb = max(rb, B[y][x]);
}
}
int diff = rr-lr + rg-lg + rb-lb;
diff /= 3;
mindiff = min(mindiff, diff);
}
if (mindiff > 50) return 3;
if (mindiff > 20) return 2;
//cout<<"diff="<<mindiff<<endl;
if (sum_green > sum+20) return 2;
return 1;
//cout<<"sum="<<sum<<", green="<<sum_green<<"\n";
//if (sum > 140) return 1;
//else return 3;
}
