1 program Neayo;
 2 const
 3         inf='sequence.in';
 4         ouf='sequence.out';
 5 var
 6         i,j,t:longint;
 7         k,a,b,ans,kk:int64;
 8 function min(a,b:int64):int64;
 9 begin
10      if a<b then exit(a) else exit(b);
11 end;
12 procedure init;
13 begin
14      assign(input,inf);assign(output,ouf);
15      reset(input);rewrite(output);
16      readln(t);
17      for t:=1 to t do
18      begin
19           readln(k,a,b);
20           ans:=0;
21           if k>=b then
22           begin
23                if k>b then writeln(0) else writeln(1);
24                continue;
25           end;
26           if k=0 then
27           begin
28                writeln(b-a+1);
29                continue;
30           end;
31           if k>=a then
32           begin
33                a:=k;
34                inc(ans);
35                if (not odd(k))and(k+1<=b)then inc(ans);
36           end;
37           kk:=k;
38           if not odd(kk) then
39           begin
40                kk:=kk+1;
41                if (kk>=a)and(k<a) then inc(ans);
42           end;
43           while k<b do
44           begin
45                k:=k shl 1;
46                kk:=(kk shl 1)+1;
47                if k>b then break;
48                if k>=a then ans:=ans+min(kk,b)-k+1;
49                if (k<a)and(kk>=a) then ans:=ans+min(kk,b)-a+1;
50           end;
51           writeln(ans);
52      end;
53      close(input);
54 end;
55 begin
56      init;
57      close(output);
58 end.

program Neayo;
constinf='sequence.in';ouf='sequence.out';
vari,j,k,n:longint;max,ans:int64;half,tmp:extended;a:array[0..200001]of int64;procedure init;
beginassign(input,inf);assign(output,ouf);reset(input);rewrite(output);readln(n);for i:=1 to n dobeginreadln(a[i]);if a[i]>max then max:=a[i];end;tmp:=max;half:=tmp/2;for i:=1 to n doif a[i]<max thenbegintmp:=a[i];inc(ans);while tmp<half dobegintmp:=tmp*2;inc(ans);end;end;inc(ans,max);writeln(ans);close(input);
end;begininit;close(output);
end.