#include<iostream>

#include<cstdio>

#include<cmath>

#include<ctime>

#include<queue>

#include<map>

#include<algorithm>

#include<cstring>

using namespace std;

#define duke(i,a,n) for(register int i = a;i <= n;i++)

#define lv(i,a,n) for(register int i = a;i >= n;i--)

#define clean(a) memset(a,0,sizeof(a))

const int INF =  << ;

typedef long long ll;

typedef double db;

template <class T>

void read(T &x)

{

    char c;

    bool op = ;

    while(c = getchar(), c < '' || c > '')

        if(c == '-') op = ;

    x = c - '';

    while(c = getchar(), c >= '' && c <= '')

        x = x *  + c - '';

    if(op) x = -x;

}

template <class T>

void write(T x)

{

    if(x < ) putchar('-'), x = -x;

    if(x >= ) write(x / );

    putchar('' + x % );

}

map <ll,int> mp;

ll t,m,n,ans,now;

ll p,a,b;

bool flag;

ll qpow(ll a,ll b)

{

    ll sum = ;

    while(b)

    {

        if(b %  == )

        {

            sum *= a;

        }

        a *= a;

        sum %= p;

        a %= p;

        b >>= ;

    }

    return sum;

}

int main()

{

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

    {

        if(a % p == )

        {

            printf("no solution\n");

            continue;

        }

        mp.clear();

        m = ceil(sqrt(p));

        flag = false;

        now = b % p;

        mp[now] = ;

        for(int i = ;i <= m;i++)

        {

            now = (now * a) % p;

            mp[now] = i;

        }

        t = qpow(a,m);

        now = ;

        duke(i,,m)

        {

            now = (now * t) % p;

            if(mp[now])

            {

                flag = true;

                ans = i * m - mp[now];

                printf("%lld\n",(ans % p + p) % p);

                break;

            }

        }

        if(!flag)

        printf("no solution\n");

    }

    return ;

}