The campus has m rooms numbered from 0 to m - 1. Also the x-mouse lives in the campus. The x-mouse is not just a mouse: each second x-mouse moves from room i to the room i ⋅ x mod{m} (in fact, it teleports from one room to another since it doesn't visit any intermediate room). Starting position of the x-mouse is unknown.

You are responsible to catch the x-mouse in the campus, so you are guessing about minimum possible number of traps (one trap in one room) you need to place. You are sure that if the x-mouse enters a trapped room, it immediately gets caught.

And the only observation you made is GCD (x, m) = 1.

Input

The only line contains two integers m and x (2 ≤ m ≤ 10^{14}, 1 ≤ x < m, GCD (x, m) = 1) — the number of rooms and the parameter of x-mouse. 

Output

Print the only integer — minimum number of traps you need to install to catch the x-mouse.

Examples

Input

4 3


Output

3


Input

5 2


Output

2

Note

In the first example you can, for example, put traps in rooms 0, 2, 3. If the x-mouse starts in one of this rooms it will be caught immediately. If x-mouse starts in the 1-st rooms then it will move to the room 3, where it will be caught.

In the second example you can put one trap in room 0 and one trap in any other room since x-mouse will visit all rooms 1..m-1 if it will start in any of these rooms.
#include <bits/stdc++.h>
using namespace std;
const int B = 1e7 + 10;
int mndv[B], prm[B], nprm;
int mdv[60][2], gdv[60], ndv;
long long phidv[60];
int Ndv;
long long m, x;
inline long long Mul(long long a, long long b, long long mod) {
  a %= mod, b %= mod;
  long long z = (long double)a / mod * b;
  long long res = (unsigned long long)a * b - (unsigned long long)z * mod;
  return (res + mod) % mod;
}
long long Pow(long long a, long long b, long long mod) {
  long long c = 1;
  while (b) {
    if (b & 1) c = Mul(c, a, mod);
    a = Mul(a, a, mod);
    b >>= 1;
  }
  return c;
}
void Init() {
  for (int i = 2; i < B; i++) {
    if (!mndv[i]) prm[++nprm] = mndv[i] = i;
    for (int j = 1; j <= nprm && prm[j] * i < B; j++) {
      mndv[prm[j] * i] = prm[j];
      if (i % prm[j] == 0) continue;
    }
  }
}
void Divide(int g) {
  for (int i = 1; i <= ndv; i++) gdv[i] = 0;
  while (g > 1) {
    gdv[prm[mndv[g]]]++;
    g /= mndv[g];
  }
}
long long Run(const long long& phi, const long long& mod) {
  long long ord = phi, tmpphi = phi;
  for (int i = 1; i <= Ndv; i++)
    if (tmpphi % phidv[i] == 0) {
      int cnt = 0;
      while (tmpphi % phidv[i] == 0) cnt++, tmpphi /= phidv[i];
      long long tdv = 1, mxdv = 1;
      for (int j = 0; j <= cnt; j++, tdv *= phidv[i])
        if (Pow(x, phi / tdv, mod) == 1) mxdv = max(mxdv, tdv);
      ord /= mxdv;
    }
  return phi / ord;
}
int main() {
  Init();
  scanf("%lld%lld", &m, &x);
  long long tmpm = m, phim = m;
  for (int i = 2; i < B; i++)
    if (tmpm % i == 0) {
      phim = phim / i * (i - 1);
      mdv[++ndv][0] = i, prm[i] = ndv;
      while (tmpm % i == 0) mdv[ndv][1]++, tmpm /= i;
    }
  if (tmpm > 1) phim = phim / tmpm * (tmpm - 1);
  long long tmpphi = phim;
  for (int i = 2; i < B; i++)
    if (tmpphi % i == 0) {
      phidv[++Ndv] = i;
      while (tmpphi % i == 0) tmpphi /= i;
    }
  if (tmpphi > 1) phidv[++Ndv] = tmpphi;
  long long ans = 0;
  for (int g = 1; g <= m / g; g++)
    if (m % g == 0) {
      Divide(g);
      long long phi = g;
      for (int i = 1; i <= ndv; i++)
        if (gdv[i]) phi = phi / mdv[i][0] * (mdv[i][0] - 1);
      if (tmpm > 1 && g % tmpm == 0) phi = phi / tmpm * (tmpm - 1);
      ans += Run(phi, g);
      if (m / g != g) {
        phi = m / g;
        for (int i = 1; i <= ndv; i++)
          if (gdv[i] < mdv[i][1]) phi = phi / mdv[i][0] * (mdv[i][0] - 1);
        if (tmpm > 1 && g % tmpm) phi = phi / tmpm * (tmpm - 1);
        ans += Run(phi, m / g);
      }
    }
  printf("%lld\n", ans);
  return 0;
}
