Background

Special for beginners, ^_^

Extreme Value Problem

Problem Description

$m$ and $n$ are integers satisfying the following two conditions:

• $m, n \in \{1, 2, \dots, k\}$, i.e. $1 \le m, n \le k$;
• $(n^2 - mn - m^2)^2 = 1$.

Your task: given a positive integer $k$ ($1 \le k \le 10^9$), find a pair of $m, n$ satisfying the two conditions above such that $m^2 + n^2$ is maximised. For example, if $k = 1995$ is entered from the keyboard, the output is:

m=987
n=1597

Input Format

One positive integer $k$.

Output Format

Output $2$ lines: the first line contains one integer, the value of $m$; the second line contains one integer, the value of $n$. The output format is exactly as in the sample, with no spaces in between.

Note: the lines m=987 and n=1597 must be printed exactly as shown — the judge compares them character by character, so do not change the letters or add/remove spaces.

Sample Input

1995

Sample Output

m=987
n=1597

Constraints

1s, 1024KiB for each test case.