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<bits/stdc++.h>

#define rep(i,n) for(ll i = 0; i < (n); i++)
#define ll long long

using namespace std;

int main(){
  double n;cin>>n;
  rep(i,3500)rep(j,3500){
    ll x=i+1;
    ll y=j+1;
    ll z = (n*x*y)/(4*x*y-n*x-n*y);
    if(z<0)continue;
    if(4*x*y*z==n*y*z+n*x*z+n*x*y){
      cout<<x<<' '<<y<<' '<<z;
      return 0;
    }
  }
  
  return 0;
}