#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
clock_t tStart = clock();
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const long long mx = 1000000000000000000;
long long L, R;
set<long long> st;
vector<long long> v;
bool sq1(long long num) {
  long long temp;
  long long lo = 1, hi = 1000000000, mid;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    temp = mid * mid;
    if (temp == num)
      return 1;
    else if (temp > num)
      hi = mid - 1;
    else
      lo = mid + 1;
  }
  return 0;
}
bool sq2(long long num) {
  long long p = sqrt(num);
  if (p * p == num) return 1;
  if ((p + 1) * (p + 1) == num) return 1;
  if ((p - 1) * (p - 1) == num) return 1;
  return 0;
}
long long bin(long long key) {
  long long lo = 1, hi = 1000000000, mid;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (mid > key / mid)
      hi = mid - 1;
    else
      lo = mid + 1;
  }
  return hi;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  st.insert(1);
  for (long long i = 2; i <= 1000000; ++i) {
    long long temp = mx / i;
    for (long long j = i * i;; j *= i) {
      if (!sq2(j)) st.insert(j);
      if (j > temp) break;
    }
  }
  for (set<long long>::iterator itr = st.begin(); itr != st.end(); ++itr) {
    v.emplace_back(*itr);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    cin >> L >> R;
    long long ans =
        upper_bound(v.begin(), v.end(), R) - lower_bound(v.begin(), v.end(), L);
    long long up = bin(R);
    if (up >= 1) --up;
    long long lo = bin(L - 1);
    if (lo >= 1) --lo;
    ans += up - lo;
    cout << ans << '\n';
  }
}
