#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long z) {
  long long ret = 1;
  while (y > 0) {
    if (y & 1) ret = (ret * x) % z;
    x = (x * x) % z;
    y >>= 1;
  }
  return ret;
}
const long long MOD = 1e9 + 7;
long long gcd(long long a, long long b) {
  if (b > a) swap(a, b);
  if (!b) return a;
  return gcd(b, a % b);
}
int main() {
  long long n, l, r;
  scanf("%lld%lld%lld", &n, &l, &r);
  if (n == 1)
    printf("%lld\n", r - l + 1);
  else if (n == 2)
    printf("%lld\n", (r - l) * (r - l + 1));
  else if (n >= 30)
    printf("0\n");
  else {
    long long ans = 0, cnt = 2;
    while (power(cnt, n - 1, MOD) <= r) ++cnt;
    for (long long i = 1; i <= cnt; ++i) {
      long long yn = power(i, n - 1, MOD);
      if (yn > r) break;
      for (long long j = i + 1; j <= cnt; ++j) {
        if (gcd(i, j) == 1) {
          long long xn = power(j, n - 1, MOD);
          for (long long a = (l + yn - 1) / yn * yn; a <= r; a += yn) {
            if (a * xn / yn > r) break;
            ++ans;
          }
        }
      }
    }
    printf("%lld\n", ans * 2);
  }
  return 0;
}
