#include <cstdio>
        using namespace std;
        bool prim (long long int x)
        {
            int i;
            for (i=2; i*i<=x; i++)
                if (x%i==0) return false; return true;
        }
        int main()
        {
            long long int a, n, i;
            freopen("inversmodular.in","r",stdin);
            freopen("inversmodular.out","w",stdout);
            scanf("%lld%lld",&a,&n);
            if (prim(n))
            {
                long long int x=1;
                for (i=1; i<=n-2; i++)
                {
                    x*=a; x%=n;
                }
                printf("%lld",x);
            }
            else printf("-1");
            fclose(stdin);
            fclose(stdout);
            return 0;
        }