#include <iostream>
#include <list>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;
template <class T>
using Vec = std::vector<T>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); (i)++)
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); i--)
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())
#define rSORT(A) std::sort((A).rbegin(), (A).rend())
// 座標圧縮 (for vector) : ソートしてから使うのが一般的 ; SORT(A) => COORDINATE_COMPRESSION(A)
#define COORDINATE_COMPRESSION(A) (A).erase(unique((A).begin(),(A).end()),(A).end())



template <class T> inline int argmin(std::vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(std::vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){a = max(a, b);}
template <class T> inline void chmin(T &a, T b){a = min(a, b);}
inline int BitI(int k){return 1 << k;}
inline lli BitL(int k){return 1L << k;}
inline int toInt(string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline int toInt(const string s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res = "";
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

using Vbool = std::vector<bool>;

template <class T>
vector<pair<T, int>> prime_factorization(T integer_n){
  if(integer_n == 0) return vector<pair<T, int>>(0);
  vector<pair<T, int>> res;
  int two_factor = 0;
  while((integer_n & 1) == 0){ // 2で割れる回数
    integer_n >>= 1;
    two_factor++;
  }
  if(two_factor > 0) res.emplace_back(make_pair(2, two_factor));
  for(T i = 3; i < integer_n; i += 2){ // 奇素数の因数を数える
    if(integer_n % i == 0){
      integer_n /= i;
      int factor = 1;
      while(integer_n % i == 0){
        integer_n /= i;
        factor++;
      }
      res.emplace_back(make_pair(i, factor));
    }
  }
  if(integer_n > 1) res.emplace_back(make_pair(integer_n, 1));
  return res;
}

int main(void){
  int n, p; scanf("%d%d", &n, &p);
  Vbool hasDone(n+1, false);
  std::queue<int> A; A.push(p); hasDone[p] = true; int cnt = 1;
  while(not A.empty()){
    int next = A.front(); A.pop();
    std::vector<pii> pf = prime_factorization(next);
    if(pf.size() == 1){
      const int primeN = pf[0].first;
      for(lli sss = 2 * primeN; sss <= n; sss += primeN){
        if(not hasDone[sss]){
          hasDone[sss] = true; cnt++;
          A.push(sss);
        }
      }
    }
    else{
      vREP(ele, pf){
        if(not hasDone[ele.first]){
          hasDone[ele.first] = true; cnt++;
          A.push(ele.first);
        }
      }
    }
  }
  printf("%d\n", cnt);
  return 0;
}