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;
long long p[1005], q[1005], n, X, ans;
int num, tot;
long long phi(long long x) {
  long long ret = x;
  for (int i = 1; i <= num; i++)
    if (!(x % p[i])) ret /= p[i], ret *= p[i] - 1;
  return ret;
}
long long q_mul(long long x, long long n, long long mod) {
  if (n < 2147483647 && x < 2147483647) return n * x % mod;
  long long ret = 0;
  for (; n; n >>= 1, x = (x << 1) % mod)
    if (n & 1) ret = (ret + x) % mod;
  return ret;
}
long long q_pow(long long x, long long n, long long mod) {
  long long ret = 1;
  for (; n; n >>= 1, x = q_mul(x, x, mod))
    if (n & 1) ret = q_mul(ret, x, mod);
  return ret;
}
void work(long long g) {
  long long mod = n / g, ph = phi(mod), x = X % mod, K = ph;
  for (int i = 1; i <= tot; i++)
    while (K % q[i] == 0 && q_pow(x, K / q[i], mod) == 1) K /= q[i];
  ans += ph / K;
}
void get_pri(long long x) {
  q[++tot] = x + 1;
  for (int i = 2; i <= (x / i); i++)
    if (x % i == 0) {
      q[++tot] = i;
      while (x % i == 0) x /= i;
    }
  if (x != 1) q[++tot] = x;
}
void init() {
  long long x = n;
  for (int i = 2; i <= (x / i); i++)
    if (x % i == 0) {
      p[++num] = i;
      while (x % i == 0) x /= i;
    }
  if (x != 1) p[++num] = x;
  for (int i = 1; i <= num; i++) get_pri(p[i] - 1);
  sort(q + 1, q + tot + 1);
  tot = unique(q + 1, q + tot + 1) - q - 1;
}
int main() {
  scanf("%lld%lld", &n, &X);
  init();
  int i;
  for (i = 1; i < (n / i); i++)
    if (n % i == 0) work(i), work(n / i);
  if (1ll * i * i == n) work(i);
  printf("%lld\n", ans);
}
