Vladik and Chloe decided to determine who of them is better at math. Vladik claimed that for any positive integer n he can represent fraction <image> as a sum of three distinct positive fractions in form <image>.

Help Vladik with that, i.e for a given n find three distinct positive integers x, y and z such that <image>. Because Chloe can't check Vladik's answer if the numbers are large, he asks you to print numbers not exceeding 109.

If there is no such answer, print -1.

Input

The single line contains single integer n (1 ≤ n ≤ 104).

Output

If the answer exists, print 3 distinct numbers x, y and z (1 ≤ x, y, z ≤ 109, x ≠ y, x ≠ z, y ≠ z). Otherwise print -1.

If there are multiple answers, print any of them.

Examples

Input

3


Output

2 7 42


Input

7


Output

7 8 56
import java.util.*;
import java.io.*;

public class Main {
	private Input cin;
	private PrintWriter cout;
	
	public Main() throws IOException{
		cin=new Input();
		cout=new PrintWriter(System.out);
	}
	
	final int MAXN = 51; 
	
	int N;
	
	public void TaskC() throws IOException{
		N = cin.nextInt();
		if(N == 1){
			cout.println(-1);
		}
		else{
			cout.println(N + " " + (N + 1) + " " + (N * (N + 1)));
		}
		cout.close();
	}
	
	public static void main(String[] args) throws IOException{
		new Main().TaskC();
	}
}


class Input {
    private final BufferedReader br;
    private StringTokenizer st;
    private String last;

    public Input() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }
    
    String next() throws IOException {
        while (st == null || !st.hasMoreElements())
            st = new StringTokenizer(br.readLine());
        last = null;
        return st.nextToken();
    }

    String nextLine() throws IOException {
        st = null;
        return (last == null) ? br.readLine() : last;
    }

    boolean hasNext() {
        if (st != null && st.hasMoreElements())
            return true;

        try {
            while (st == null || !st.hasMoreElements()) {
                last = br.readLine();
                st = new StringTokenizer(last);
            }
        } catch (Exception e) {
            return false;
        }

        return true;
    }

    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(next().replace(',', '.'));
    }
}

 	 	 	  			  		   			   	    	