#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cmath>

 #include<map>

 using namespace std;

 #define LL long long

 LL p,a,b;

 map<LL,LL>q;

 int main(){

     while(~scanf("%lld%lld%lld",&p,&a,&b)){

         if(b==){printf("0\n");continue;}

         if(a==b){printf("1\n");continue;}

         LL w=(LL)sqrt((double)p),x=,y=;if(w*w!=p)++w;

         q[b]=-;

         for(int i=;i<=w;++i){x=(x*a)%p;LL z=(b*x)%p;if(q[z]==)q[z]=i;}

         bool f=;

         for(int i=;i<=w;++i){

             y=(y*x)%p;

             if(q[y]!=){

                 LL z=q[y];if(z==-) z=;

                 z=(LL)i*w-z;f=;

                 printf("%lld\n",z);

                 break;

             }

         }

         q[b]=;x=;

         for(int i=;i<=w;++i){x=(x*a)%p;LL z=(b*x)%p;q[z]=;}

         if(!f)printf("no solution\n");

     }

     return ;

 }