#include #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--) #define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++) #define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++) #define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++) #define ALL(n) begin(n), end(n) using ll = long long; using namespace std; int di(double x, double y, double x1, double x2, double y1, double y2, double dd){ double ax = y2- y1, ay = x1-x2, ac = (x2-x1)*y1 - (y2-y1)*x1; double r = fabs(ax*x + ay*y + ac); double l = ((ax*ax) + (ay*ay))*dd; r = r * r; // cerr << r << " " << l << endl; if(l < r)return 0; else if(l == r) return 4; else return 8; } int main(){ int d1, d2; cin >> d1 >> d2; int ans = di(0, 0, sqrt(d2), 0, 0, sqrt(d2), d1); cout << ans << endl; return 0; }