Marathon Range

You are given a Integer $N$ . Your task is to find a range $[L,R]$ (both inclusive), such that the sum of all integer in range $L,L+1,L+2,....+R$ becomes equal to $N$. Lets consider $N$ to be 6 then the one of range is $[1,3]$ make the sum equal to $6$ $(1+2+3)$. In all possible ranges you have to print longest one. You have to keep in mind that $ L \lt R $. ### Input - First line will contain