import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = 10 ^^ 5 + 1;
    auto P = new bool[](N);
    foreach (i; 2 .. N)
        P[i] = f(i);
    auto PP = new bool[](N);
    foreach (i; 3 .. N)
        PP[i] = ((i & 1) != 0) && P[i] && P[(i + 1) / 2];
    auto S = new long[](N + 1);
    foreach (i; 0 .. N)
        S[i + 1] = S[i] + PP[i];
    long Q = lread();
    foreach (_; 0 .. Q)
    {
        long l, r;
        scan(l, r);
        writeln(S[r + 1] - S[l - 1]);
    }
}

bool f(long x)
{
    foreach (i; 2 .. x)
    {
        if (x < i * i)
            return true;
        if (x % i == 0)
            return false;
    }
    return true;
}
