A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.

The playing area in the game is split into congruent cells that are regular hexagons. The side of each cell is equal to 1. Each unit occupies exactly one cell of the playing field. The field can be considered infinite. 

Let's take a look at the battle unit called an "Archer". Each archer has a parameter "shot range". It's a positive integer that determines the radius of the circle in which the archer can hit a target. The center of the circle coincides with the center of the cell in which the archer stays. A cell is considered to be under the archer’s fire if and only if all points of this cell, including border points are located inside the circle or on its border.

The picture below shows the borders for shot ranges equal to 3, 4 and 5. The archer is depicted as *A*. 

Find the number of cells that are under fire for some archer.
The first and only line of input contains a single positive integer *k* — the archer's shot range (1 ≤ *k* ≤ 10<sup class="upper-index">6</sup>).
none
3
7
4
13
5
19
9
85
11
121
51
3037
101
12109
911
1001425
1
1
2
1
8
61
6
31
7
43
10
97
13
175
43
2137
88
9151
217
56425
301
108847
403
195457
1034
1290385
1249
1883353
2749
9131485
5832
41114119
6486
50854039
6726
54687523
8910
95975509
9654
112674937
9991
120678955
10000
120896557
10264
127364821
21352
551234029
40094
1943730367
47248
2699275123
100000
12091764163
225481
61477218007
498598
300605820001
777777
731487842995
999811
1208740231393
999998
1209192430093
999999
1209194850235
1000000
1209197264797
from math import sqrt

t = int(input())
rList = [int(i) for i in input().split(' ')]
for i in range(t):
    r = rList[i]
    r2 = r * r
    b = 1
    sig = True
    sums = 0
    while(b <= r):
        sig =  True
        a = b - 0.5
        # print(a, b, r2)
        n1 = sqrt((r2 - a * a) * 4 / 3)
        n2 = sqrt((r2 - b * b) * 4 / 3)

        # print(n1, n2)

        if sig:
            n1 -= 1
        else:
            n2 += 1

        n1 //= 2
        n2 //= 2
        num = int(min(n1, n2))
        # print('num :', num)
        
        if b == 1:
            sums = num * 2 + 1
        elif sig:
            sums += num * 4 + 2
        else:
            sums + num * 4

        sig = not sig
        b += 1.5

    print(sums)