Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden

TENNIS1 - TENNIS CHAMPIONSHIP

no tags 

N (2<=N<=10^18) players take part in tennis championship. In every match loser is out. Two players can play a game if in that moment the difference of played games of that two players is not more than 1. They are interested, how many matches will be in the champioship (maximal possible number) and what's the maximal possible number of games in which can take part the champion in that case.

Input

Single number N.

Output

Two numbers - answers to the questions.

Example

Input:
4

Output:
2 3

Added by:albertg
Date:2014-01-26
Time limit:0.100s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU
Resource:Own problem