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:
//Author: Lixiang
#include<stdio.h>
#include<iostream>
using namespace std;
struct C{
	long long N;
	void init(){
		cin>>N;
	}
	void work(){
		long long zi,mu,h,n;
		for(h=1;h<=3500;h++)
			for(n=1;n<=3500;n++){
				zi=4*h*n-N*(h+n);
				mu=N*h*n;
				if(zi>0&&mu%zi==0){
					cout<<h<<" "<<n<<" "<<mu/zi;
					return ;
				}
			}
	}
}sol;
int main(){
	sol.init();
	sol.work();
	return 0;
}