#include<bits/stdc++.h>
using namespace std;

using ll=long long;
ll modpow(ll n,ll k,ll mod){
  ll pw=n;
  ll ret=1;
  while (k){
    if (k%2==1){
      ret*=pw;
      ret%=mod;
    }
    pw=pw*pw;
    pw%=mod;
    k/=2;
  }
  return ret;
}
  
int main(){
  ll n,b;
  cin>>n>>b;
  vector<ll> pw(b),cnt(b);
  for (int i=0;i<b;i++) cnt[pw[i]=modpow(i,n,b)]++;
  ll ans=0;
  for (int i=0;i<b;i++) for (int j=0;j<b;j++) ans+=cnt[(pw[i]+pw[j])%b];
  cout<<ans<<endl;
}