For this Question: Harry is very confused after knowing all about Sirius. To lighten Harry's mood Sirius asks a fun problem to him. Sirius puts K talking skulls equally spaced on the circumference of a circle. Now he enumerates them from 1 to K in clockwise order. Now given skull X and skull Z, he asks Harry to find number of possible Y such that angle XYZ is obtuse(more than 90 degrees).
Note:- X Y and Z must be different.The first line of the input contains single integer T, denoting number of test cases.
Each test case contains three integers K, X and Z.

Constraints
1 <= T <= 10
1 <= K <= 1000000000
1 <= X, Y <= KFor each testcase print number of possible Y in a new line.Sample Input
2
6 1 3
10 1 5

Sample Output
1
3

Explanation:
For first case, 2 is the suitable skull.
For second case, 2, 3 and 4 are the suitable skulls., I have written this Solution Code: k = int(input())
for i in range(k):
    z = 0
    a = input().split()
    a = [int(i) for i in a]
    rad = 360/a[0]
    dia = abs(a[2]-a[1])
    ang = rad*dia
    if(ang/2 > 90):
        z = a[0]- dia - 1
    elif(ang/2 < 90):
        z = dia - 1
    else:
        z = 0
    print(z)
    a.clear(), In this Programming Language: Python, Now tell me if this Code is compilable or not?