#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

struct Q {
    int l, r, id;
    bool operator<(const Q& w) const {
        return l < w.l;
    }
}q[N];

struct ST {
    struct Node {
        int l, r;
        ll sum, flag;
    };
    vector<Node> tr;

    ST(ST&& other) noexcept : tr(move(other.tr)) { }
    ST (int l, int r) : tr(vector<Node>(((r - l + 10) << 2) + 10)) {
        build(1, l, r);
    }

    ST& operator=(ST&& other) noexcept {
        if (this != &other) {
            tr = move(other.tr);
        }
        return *this;
    }

private:
    void pushup(int u) { tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum; }
    void pushdown(Node& u, Node& l, Node& r) {
        l.flag += u.flag, r.flag += u.flag;
        l.sum += u.flag * (l.r - l.l + 1), r.sum += u.flag * (r.r - r.l + 1);
        u.flag = 0;
    }
    void pushdown(int u) { if (tr[u].flag) pushdown(tr[u], tr[u << 1], tr[u << 1 | 1]); }

    void build(int u, int l, int r) {
        tr[u] = {l, r, 1};
        if (l == r) return;
        int mid = l + r >> 1;
        build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
        pushup(u);
    }

public:
    ll query(int u, int l, int r) {
        if (tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
        pushdown(u);
        int mid = tr[u].l + tr[u].r >> 1;
        ll res = 0;
        if (l <= mid) res += query(u << 1, l, r);
        if (r > mid) res += query(u << 1 | 1, l, r);
        return res;
    }

    void modify(int u, int l, int r, ll v) {
        if (tr[u].l >= l && tr[u].r <= r) tr[u].sum = v;
        else {
            pushdown(u);
            int mid = tr[u].l + tr[u].r >> 1;
            if (l <= mid) modify(u << 1, l, r, v);
            if (r > mid) modify(u << 1 | 1, l, r, v);
            pushup(u);
        }
    }
};

int c[N], ans[N];
int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%d%d", &q[i].l, &q[i].r), q[i].id = i;
    sort(q + 1, q + n + 1);
    ST tr(1, 1e6);
    for (int i = 1; i < 1000000; i++) {
        for (int j = i * 2; j <= 1000000; j += i) {
            c[j]++;
            if (c[j] == 1) tr.modify(1, j, j, 0);
        }
    }
    int l = 1;
    for (int i = 1; i < n + 1; i++) {
        while (l < q[i].l) {
            for (int j = l * 2; j <= 1000000; j += l) {
                c[j]--;
                if (!c[j]) tr.modify(1, j, j, 1);
            }
            l++;
        }
        ans[q[i].id] = tr.query(1, q[i].l, q[i].r);
    }
    for (int i = 1; i < n + 1; i++) printf("%d\n", ans[i]);
    return 0;
}