#include <iostream>

#include <vector>

#include <cstring>

#include <cstdio>

#include <cmath>

#include <map>

#define pb push_back

#define fi first

#define se second

#define mk make_pair

using namespace std;

typedef long long LL;

typedef pair<int, int> PII;

LL A, B, P, phi, T;

const int MOD = 1e6+;

vector<PII> H[MOD+];

LL qpow(LL a, LL b, LL P){

    LL ans = ; for(; b; b >>= , (a*=a)%=P) if(b&) (ans*=a)%=P; return ans;

}

inline void Hinsert(LL x, int v){ H[x%MOD].pb(mk(x, v)); }

inline void Herase(LL x) {  H[x%MOD].clear(); }

inline int Hfind(LL x){

    int u = x%MOD;

    for(int i = ; i < H[u].size(); i++) if(H[u][i].fi == x) return H[u][i].se;

    return ;

}

int main()

{

    while(scanf("%lld %lld %lld", &P, &A, &B) != EOF){

        phi = P-;

        T = sqrt(phi+0.5);

        int i;

        LL At = A, AA;

        for(i = ; i <= T; Hinsert(At*B%P, i), i++, (At*=A)%=P);

        AA = qpow(A, T, P); At = AA;

        for(i = ; i*T <= P && !Hfind(At); i++, (At*=AA)%=P); //<=P 恰好可以覆盖0~P-1这些情况

        if(Hfind(At)){ printf("%lld\n", i*T - Hfind(At)); }

        else printf("no solution\n");

        for(At = A, i = ; i <= T; Herase(At*B%P), i++, (At*=A)%=P);

    }

}