Preparando MOJI

Hexagons

1000ms 262144K

Description:

Ayrat is looking for the perfect code. He decided to start his search from an infinite field tiled by hexagons. For convenience the coordinate system is introduced, take a look at the picture to see how the coordinates of hexagon are defined:

Ayrat is searching through the field. He started at point (0, 0) and is moving along the spiral (see second picture). Sometimes he forgets where he is now. Help Ayrat determine his location after n moves.

Input:

The only line of the input contains integer n (0 ≤ n ≤ 1018) — the number of Ayrat's moves.

Output:

Print two integers x and y — current coordinates of Ayrat coordinates.

Sample Input:

3

Sample Output:

-2 0

Sample Input:

7

Sample Output:

3 2

Informação

Codeforces

Provedor Codeforces

Código CF615E

Tags

binary searchimplementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:03:13

Relacionados

Nada ainda