#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
const int mmod = 6;
int stmod(string s, int k) {
    int cur = 0;
    rep(i, s.size()) {
        cur = cur * 10 + (s[i]-'0');
        cur -= (cur/k) * k;
    }
    return cur;
}

int a[100];
int main() {
    string A = "428571";
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    string n,k; cin >> n >> k;

    int root = stmod(n, mmod);
    // cout << root << endl;

    map<int,int> cnt;
    int cur = root;
    int idx = 1;
    while(cnt[cur]==0) {
        cnt[cur]++;
        a[idx] = cur;
        idx++;
        cur = cur * root % mmod;
    }
    a[0] = a[idx-1];
    // cout << a[idx-1] << endl;
    // cout << idx << endl;
    // cout << stmod(k, idx-1) << endl;
    cout << A[a[stmod(k, idx-1)]] << endl;
    return 0;
}