Problem: You are given an integer N.

Find a triple of positive integers h, n and w such that 4/N = 1/h + 1/n + 1/w.

If there are multiple solutions, any of them will be accepted.

Constraints

* It is guaranteed that, for the given integer N, there exists a solution such that h,n,w \leq 3500.

Inputs

Input is given from Standard Input in the following format:


N


Outputs

Print a triple of positive integers h, n and w that satisfies the condition, in the following format:


h n w

Examples

Input

2


Output

1 2 2


Input

3485


Output

872 1012974 1539173474040


Input

4664


Output

3498 3498 3498

Solution (in CPP):

Solution:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
long long a,b,c,d,m;
int main()
{
	cin>>c;
    for(a=1;a<=3500;a++)
        for(b=1;b<=3500;b++)
		{
            d=c*a*b;
            m=4*a*b-c*a-c*b;
            if(m>0&&d%m==0)
            {
            	cout<<a<<" "<<b<<" "<<d/m<<endl;
            	return 0;
			}
        }
}