#include #include using namespace std; using namespace atcoder; using lint = long long; using ulint = unsigned long long; using llint = __int128; #define endl '\n' lint const mod107 = 1e9+7; using mint107 = modint1000000007; long const mod = 998244353; using mint = modint998244353; int const INF = 1<<30; lint const INF64 = 1LL<<61; lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}} lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}} lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;} lint gcd(lint a,lint b){if(a&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;} lint chmax(vector&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;} double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));} string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;} string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;} vectorprime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j>7); return (x^=(x<<17)); } struct Frac { lint upper, lower; Frac() { Frac(0,1); } Frac(lint u, lint l) { assert(l != 0); if(u <= 0 && l < 0) { upper = -u; lower = -l; } else { upper = u; lower = l; } reduction(); } Frac(lint u) { upper = u; lower = 1; } void reduction() { if(upper != 0) { lint g = gcd(abs(upper), abs(lower)); upper /= g; lower /= g; if(lower < 0) { lower *= -1; upper *= -1; } } else { lower = 1; } } Frac operator+(const Frac &other) { lint L = lower * other.lower; lint U = upper*other.lower + lower*other.upper; return Frac(U, L); } Frac operator-(const Frac &other) { lint L = lower * other.lower; lint U = upper*other.lower - lower*other.upper; upper = U; lower = L; return Frac(U, L); } bool operator<=(const Frac &other) { return upper*other.lower <= lower*other.upper; } Frac operator*(const Frac &other) { lint L = lower * other.lower; lint U = upper * other.upper; return Frac(U, L); } Frac operator/(const Frac &other) { assert(other.upper != 0); lint L = lower * other.upper; lint U = upper * other.lower; return Frac(U, L); } }; bool operator<(const Frac &left, const Frac &right) { return left.upper*right.lower < left.lower*right.upper; } struct edge{ int to; }; using graph = vector>; int main(){ int a,b,c; cin >> a >> b >> c; if((a*b + b*c + c*a)*2 > a*b*c) cout << 2; else cout << 3; }