#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)

int digit(char c) {
  return static_cast<int>(c-'0');
}

int digitsum(string s) {
  int sum=0;
  for(auto& ch : s)sum+=digit(ch);
  return sum;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<setprecision(std::numeric_limits<float>::max_digits10);
  string n,k;
  cin>>n>>k;
  string temp = "x285714";
//  cout << digitsum(n) << " " << digit(k[0]) << endl;
  if(digit(n.back())%2==0) { // n^k = 0 mod 2
    if(digitsum(n)%3==0) { // n^k = 0 mod3 => n^k=0 mod6
      cout << temp[6] << endl;
    }
    if(digitsum(n)%3==1) { // n^k=1 mod 3 => n^k = 4 mod6
      cout << temp[4] << endl;
    }
    if(digitsum(n)%3==2&&digit(k.back())%2==1) { // n^k = 2 mod3 => n^k=2 mod6
      cout << temp[2] << endl;
    }
    if(digitsum(n)%3==2&&digit(k.back())%2==0) // n^k == 1 mod3 => n^k == 4 mod 6
      cout << temp[4] << endl;
  } else { // n^k=1 mod 2
    if(digitsum(n)%3==0) { // n^k=0mod3 => n^k=3mod6
      cout << temp[3] << endl;
    }
    if(digitsum(n)%3==1) { // n^k=1mod3 => n^k=1mod6
      cout << temp[1] << endl;
    }
    if(digitsum(n)%3==2&&digit(k.back())%2==1) { // n^k=2mod3 => n^k=5mod6
      cout << temp[5] << endl;
    }
    if(digitsum(n)%3==2&&digit(k.back())%2==0) // n^k==1mod3 => n^k=1 mod6
      cout << temp[1] << endl;
  }
  return 0;
}