#include <bits/stdc++.h>
using namespace std;
const int mod = int(1e9) + 7;
const long long infLL = 2e18;
const int MX = 10100500;
int r1[MX];
int p[MX];
int main() {
  for (int i = 2; i * i < MX; i++) {
    if (p[i]) continue;
    for (int j = i; j * i < MX; j++) {
      p[j * i] = i;
    }
  }
  cerr << (sizeof(r1) >> 20) << endl;
  ios_base::sync_with_stdio(false);
  int n, l, r;
  cin >> n >> l >> r;
  if (n == 1) {
    cout << r - l + 1 << endl;
    return 0;
  }
  for (int j = 1; j <= r; j++) {
    long long curr = 1;
    for (int i = 0; i < n - 1; i++) {
      curr *= j;
      if (curr > r) break;
    }
    for (int i = 1; i <= r; i++) {
      if (curr * i > r) break;
      if (curr * i >= l) r1[i]++;
    }
  }
  long long ans = 0;
  for (int i = l; i <= r; i++) {
    int t = i;
    int z = 1;
    while (t > 1) {
      int pp = p[t];
      if (pp == 0) pp = t;
      int cnt = 0;
      while (t % pp == 0) {
        t /= pp;
        cnt++;
      }
      cnt /= n - 1;
      cnt *= n - 1;
      if (cnt == 0) continue;
      while (cnt--) {
        z *= pp;
      }
    }
    ans += r1[i / z] - 1;
  }
  cout << ans << endl;
  return 0;
}
