#include<bits/stdc++.h>
using namespace std;

typedef long long int ll;



int main()
{
    ll n,a,b,i,j,k;
    while(true)
    {
        cin>>n;
        if(n==0)
            break;
        cin>>a>>b;
        map<ll,ll>solcnt;
        ll x=0,mara=0;
        while(true)
        {
            x=((a*((x*x)%n)%n)+b)%n;
            solcnt[x]++;
            if(solcnt[x]==3)
                break;
            if(solcnt[x]==2)
                mara++;
        }
        cout<<n-mara<<endl;
    }
    return 0;
}