#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <climits>
#include <random>

#define _overload(a, b, c, d, ...) d
#define _rep1(X, A, Y) for (int (X) = (A);(X) <= (Y);++(X))
#define _rep2(X, Y) for (int (X) = 0;(X) < (Y);++(X))
#define rep(...) _overload(__VA_ARGS__, _rep1, _rep2)(__VA_ARGS__)
#define rrep(X,Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define all(X) (X).begin(),(X).end()
#define len(X) ((int)(X).size())
#define mod(n, m) (((n)%(m)+(m))%m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
const int INFINT = 1 << 30;                          // 1.07x10^ 9
const ll INFLL = 1LL << 60;                          // 1.15x10^18
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

const int MAX_N = 1000000;
int N, P;

bool prime[MAX_N+1];

void init(int n) {
    memset(prime, true, sizeof(prime));
    prime[0] = prime[1] = false;
    for (int i = 2; i <= n; ++i) {
        if (prime[i]) {
            for (int j = 2; j*i <= n; ++j) {
                prime[i*j] = false;
            }
        }
    }
}

bool reached[MAX_N+1];

int main() {
  std::ios::sync_with_stdio(false);std::cin.tie(0);

  cin >> N >> P;
  
  if (P == 1) {
      cout << N-1 << endl;
      return 0;
  }

  init(N);
  int lower_prime = -1;
  for (int i = 2; i <= P; ++i) {
      if (prime[i] && P%i == 0) {
          reached[i] = true;
          if (lower_prime < 0) lower_prime = i;
          break;
      }
  }

  if (2*lower_prime <= N) {
      int max_prime = lower_prime;
      for (int i = lower_prime; i <= N; ++i) {
          if (prime[i] && i*2 <= N) {
              max_prime = i;
          }
      }

      for (int i = 2; i <= max_prime; ++i) {
          if (prime[i]) {
              for (int j = 1; j*i <= N; ++j) {
                  reached[j*i] = true;
              }
          }
      }
  }

  int ans = 0;
  for (int i = 1; i <= N; ++i) {
      if (reached[i]) ++ans;
  }

  cout << ans << endl;

  return 0;
}