NINJA4  HELP SHELDON
Problem statement:
Dr. Sheldon Cooper builds a MVPD replication of himself which he calls a "Mobile Virtual Presence Device" (MVPD) that would go through all the hazards of life that he would otherwise have to
experience while he stays behind in a "secure, undisclosed location". Now the MVPD is initially standing at the origin of the Cartesian coordinate system, (0, 0). (More like Sheldon's spot (0, 0, 0, 0)). Then
the MVPD makes N turns:

On the fifth turn, the MVPD goes 5 units to the right.

And so on.
Given an integer N, find the position of Sheldon's MVPD so that he won't get lost somewhere.
Input Format
The first line contains a single integer, T, denoting the number of test cases.
For each test case, a single line contains a single integer  the value of N.
Output format:
For each test case output a single line, containing two integers  the coordinates of the MVPD after performing N turns.
Constraints:
1 <= T <= 100.
1 <= N <= 10 ^ 9.
Sample input:
2
3
4
Output:
2 2
2 2
hide comments
mag1x_:
20180626 11:22:00
pick up pen & paper then draw :3 

ai_wizard:
20180529 21:31:49
guys please give a tutorial on java. mine is slow. 

prakash1108:
20180127 19:31:56
easy af AC in 1 go. Last edit: 20180127 19:34:36 

rohan2802:
20171228 16:02:37
Leave a space between the x and y coordinates while showing the result 

shahzada:
20170609 11:31:19
tutorial. 

vengatesh15:
20170124 16:49:53
simple pattern AC in 1 go:) 

sushanth_r:
20170115 10:05:15
AC in one go :) Easy problem. Go through the pattern. That's all. 

shubham_cs_iet:
20170107 09:46:05
enjoyed deriving the formula of pattern... Last edit: 20170107 10:40:20 

aravind1997:
20160811 18:10:41
it's a pattern :)...that's it 

harshitdd120:
20160322 22:34:03
AC in 1 go

Added by:  mombassa 
Date:  20160217 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 GOSU JSMONKEY 