#include using namespace std; using ll = long long; // #define int ll using PII = pair; #define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(x) x.begin(), x.end() template T &chmin(T &a, const T &b) { return a = min(a, b); } template T &chmax(T &a, const T &b) { return a = max(a, b); } template bool IN(T a, T b, T x) { return a<=x&&x T ceil(T a, T b) { return a/b + !!(a%b); } template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a,Ts... ts) { return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value==0>::type fill_v(T &t, const V &v) { t=v; } template typename enable_if::value!=0>::type fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); } template ostream &operator <<(ostream& out,const pair& a){ out<<'('< istream& operator >> (istream& is, vector& vec){ for(T& x: vec) {is >> x;} return is; } template ostream &operator <<(ostream& out,const vector& a){ out<<'['; for(T i: a) {out<> n >> k; ll m = 0, x = 1; reverse(ALL(n)); for(char c: n) { (m += x * (c - '0') % 6) %= 6; (x *= 10) %= 6; } ll p = 0; x = 1; reverse(ALL(k)); for(char c: k) { (p += x * (c - '0') % 6) %= 6; (x *= 10) %= 6; } // 0.285714 if(m == 0) { cout << 4 << endl; } else if(m == 1) { cout << 2 << endl; } else if(m == 2) { if(p%2) cout << 8 << endl; else cout << 7 << endl; } else if(m == 3) { cout << 5 << endl; } else if(m == 4) { cout << 7 << endl; } else if(m == 5) { if(p%2) cout << 1 << endl; else cout << 2 << endl; } return 0; }