#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long n) {
  long long ans = 1;
  for (int i = 1; i <= n; i++) ans *= x;
  return ans;
}
long long gcd(long long x, long long y) {
  return (x % y == 0) ? y : gcd(y, x % y);
}
long long n, l, r;
int main() {
  cin >> n >> l >> r;
  if (n == 1)
    cout << r - l + 1;
  else if (n == 2) {
    cout << (r - l + 1) * (r - l);
  } else if (n > 30) {
    cout << 0;
  } else {
    long long ans = 0;
    for (int i = 2; i < r; i++) {
      int p = i, R = r / power(p, n - 1);
      if (R == 0) break;
      for (int j = 1; j < p; j++) {
        int q = j;
        int L = (l - 1) / power(q, n - 1) + 1;
        if (L > R) continue;
        if (gcd(p, q) == 1) {
          ans += (R - L + 1);
        }
      }
    }
    cout << ans * 2 << endl;
  }
}
