#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define eb emplace_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"LINE %d: (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }

const ll MAXn=1e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

ll euler[MAXn];
ll n,x,m;
void build(){
  euler[1] = 1;
  for(ll i=2;i<MAXn;i++){
    if(!euler[i]){
      for(ll j=i;j<MAXn;j+=i){
        if(!euler[j]) euler[j] = j;
        euler[j] = euler[j] * (i-1)/i;
      }
    }
  }
}
ll fpow(ll a,ll b){
    ll ret = 1;
    while (b) {
        if (b&1) ret = ret * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return ret;
}
bool ok[MAXn];
ll sum[MAXn];
int main(){
    IOS();
    cin >> n >> x >> m;
    build();
    ll eu = euler[m];
    ll ans = 0, cnt = 0, cur = x;
    vector<int> tmp;
    bool fg = false;
    for (ll i=1;i<=min(n,eu);++i) {
        if (ok[cur]) {
            fg = true;
            break;
        }
        tmp.eb(cur);
        ok[cur] = true;
        debug(cur);
        sum[i] = sum[i-1] + cur;
        ans += cur;
        cnt++;
        cur = cur * cur % m;
    }
    debug(tmp);
    debug(cur);
    ll aans;
    debug(cnt,n,eu);
    if (cur == 0) {
        aans = ans; 
    }
    else if (fg) {
        debug("HI");
        ll id = -1;
        for (ll i=1;i<=min(eu,n);++i) {
            if (tmp[i-1] == cur) {
                id = i;
                break;
            }
        }
        debug(cnt,id);
        aans = ans + ((n-cnt) / (cnt-id+1)) * (sum[cnt] - sum[id-1]) + (sum[id + (n-cnt) % (cnt-id+1) - 1] - sum[id-1]);
    }
    else {
        aans = sum[n];
    }
    cout << aans << endl;
}


Measured memory_bytes: 4972