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<iostream>
#include<cstring>
#define RG register
#define LL long long
using namespace std;
LL N;
int main()
{
	//freopen(".in","r",stdin);
	scanf("%lld",&N);
	for(RG LL h=1;h<=3500;h++)
	 for(RG LL n=1;n<=3500;n++)
	 {
		LL mu=4*h*n-N*n-N*h, zi=N*h*n;
		if(mu>0 && zi%mu==0 ) 
		{
			printf("%lld %lld %lld",h,n,zi/mu);
			return 0;
		}
	 }
	return 0;
}