#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y-1);(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int i,j,k;
  string st,str;
  cin>>st>>str;
  ll n,m;
  n=st[st.size()-1]-'0';
  vector<int> v,usd(10);
  ll a=1;
  while(1){
    if(usd[a])
      break;
    usd[a]=1;
    v.pb(a);
    a=a*n%10;
  }
  ll b=0;
  while(v[b]!=a)++b;
  ll r=v.size()-b,m2=0;
  for(char c:str){
    m2*=10;
    m2+=c-'0';
    m2%=r;
  }
  //  cout<<v<<b<<","<<m2<<endl;
  if(str.size()==1 && str[0]-'0'<b)
    cout<<v[str[0]-'0']<<endl;
  else
    cout<<v[(m2+r-b)%r+b]<<endl;
  return 0;
}