#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <deque>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <ctime>        // std::time
#include <cstdlib>      // std::rand, std::srand
// #include <unordered_map>
// #include <bitset>
// #include <iomanip>

using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define EPS 1e-9
#define LL_INF 0x3fffffffffffffff
#define MEM(a, b) memset(a, b, sizeof(a))
#define PPER(i, n, m) for (int i = n; i >= m; i--)
#define REPP(i, n, m) for (int i = n; i <= m; i++)
#define REP(i, n, m) for (int i = n; i < m; i++)
#define PER(i, n, m) for (int i = n; i > m; i--)
#define SA(n) scanf("%d", &(n))
#define SLLA(n) scanf("%lld", &(n))
#define MP make_pair
#define FF first
#define SS second
#define PB push_back
#define DE(val) cout << #val << ": " << val << endl;
// #define DBG(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
// #else
// #define DBG(...) 42
// #endif
const int dx44[6] = {0, -1, -1, 1, 1};
const int dy44[6] = {0, -1, 1, -1, 1};
const int dx4[6] = {0, 0, 1,-1};
const int dy4[6] = {1, -1, 0,0};
const int dx8[9] = {0, -1, 0, 1, 0, 1, 1, -1, -1};
const int dy8[9] = {0, 0, 1, 0, -1, 1, -1, 1, -1};
const int dx82[9] = {0, -1, -1, 1, 1, 2, 2, -2, -2};
const int dy82[9] = {0, 2, -2, 2, -2, 1, -1, 1, -1};

void update(ll& x,ll v){
    if(x==-1)x=v;
    else if(x>v)x=v;
}
 
ll po(ll a, ll b, ll mod)
{
    ll res = 1;
    a %= mod;
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}
ll gcd(ll a, ll b)
{
    if (a == 0)
    {
        return b;
    }
    else
    {
        return gcd(b % a, a);
    }
}
void extgcd(ll a, ll b, ll &d, ll &x, ll &y)
{
    if (!b)
    {
        d = a;
        x = 1;
    }
    else
    {
        extgcd(b, a % b, d, y, x);
        y -= x * (a / b);
    }
}
ll inverse(ll a, ll n)
{
    ll d, x, y;
    extgcd(a, n, d, x, y);
    return d == 1 ? (x + n) % n : -1;
}
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const int maxn = 2e5 + 15;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
#define mst(x, a) memset(x, a, sizeof(x))
/*************************************************************************/

ll n,xx,m;
map<ll,ll>hax;
void solve() {
    SLLA(n);
    SLLA(xx);
    SLLA(m);

    hax[xx] = 0;
    ll cnt = 1;
    std::vector<ll> v;
    v.push_back(xx);
    while(cnt < n) {
        xx = xx * xx % m;
        if(xx == 0) {
            break;
        }
        if(hax.count(xx)) {
            ll sum = 0;
            REP(i,0,hax[xx]) {
                sum += v[i];
                //DE(v[i])
            }
            // DE(hax[xx])
            // DE(v.size())
            n-=hax[xx];
            ll tmp = 0;
            REP(i,hax[xx],v.size()) {
                tmp += v[i];
            }
            // DE(tmp)
            // DE(sum)
            // DE(tmp*(n/(v.size() - hax[xx])))
            sum = sum + tmp*(n/(v.size() - hax[xx]));
            // DE(sum)
            // sum = sum*(n/v.size());
            // DE(sum)
            // DE(v.size())
            // DE(n/v.size())
            // DE(n)
            // DE(v.size())
            // DE(n%v.size())
            // DE(n%(v.size() - hax[xx]))
            int cnt = 0;
            REP(i,hax[xx],hax[xx]+n%(v.size() - hax[xx])) {
                if(i>=v.size()) {
                    break;
                }
                sum += v[i];
                // DE(sum)
                // cnt++;
                // DE(cnt)
            }
            printf("%lld\n", sum);
            return;
        } else {
            hax[xx] = v.size();
            //DE(xx)
            v.push_back(xx);
        }
        cnt++;
    }
    ll sum = 0;
    REP(i,0,v.size()) {
        sum += v[i];
    }
    printf("%lld\n", sum);
}

int main()
{   

    //  ios::sync_with_stdio(false);
    //  cin.tie(nullptr);
    solve();
    return 0;
 
}


Measured memory_bytes: 6912