Fraction（辗转相除求最大公约数）（CodeForcesOJ）

Petya is a big fan of mathematics, especially its part related to fractions. Recently he learned that a fraction is calledproper iff its numerator is smaller than its denominator (a < b) and that the fraction is calledirreducible if its numerator and its denominator are coprime (they do not have positive common divisors except1).

During his free time, Petya thinks about proper irreducible fractions and converts them to decimals using the calculator. One day he mistakenly pressed addition button ( + ) instead of division button (÷) and got sum of numerator and denominator that was equal to n instead of the expected decimal notation.

Petya wanted to restore the original fraction, but soon he realized that it might not be done uniquely. That's why he decided to determine maximum possible proper irreducible fraction such that sum of its numerator and denominator equalsn. Help Petya deal with this problem.

Input

In the only line of input there is an integer n (3 ≤ n ≤ 1000), the sum of numerator and denominator of the fraction.

Output

Output two space-separated positive integers a andb, numerator and denominator of the maximum possible proper irreducible fraction satisfying the given sum.

Examples

Input

3

Output

1 2

Input

4

Output

1 3

Input

12

Output

5 7
#include<stdio.h>int gcd(int a,int b){    int r;    while(a%b!=0) //关键    {        r=a%b;        a=b;        b=r;    }    return b;}int main(){    int i,j,n,x,y;    while(scanf("%d",&n)!=EOF)    {        for(i=1;i<=n/2;i++)        {            if( i!=n-i && gcd(i,n-i)==1)            {                x=i;                y=n-i;            }        }        printf("%d %d\n",x,y);    }    return 0;}