Recently, a chaotic virus Hexadecimal advanced a new theorem which will shake the Universe. She thinks that each Fibonacci number can be represented as sum of three not necessary different Fibonacci numbers.

Let's remember how Fibonacci numbers can be calculated. F0 = 0, F1 = 1, and all the next numbers are Fi = Fi - 2 + Fi - 1.

So, Fibonacci numbers make a sequence of numbers: 0, 1, 1, 2, 3, 5, 8, 13, ...

If you haven't run away from the PC in fear, you have to help the virus. Your task is to divide given Fibonacci number n by three not necessary different Fibonacci numbers or say that it is impossible.

Input

The input contains of a single integer n (0 ≤ n < 109) — the number that should be represented by the rules described above. It is guaranteed that n is a Fibonacci number.

Output

Output three required numbers: a, b and c. If there is no answer for the test you have to print "I'm too stupid to solve this problem" without the quotes.

If there are multiple answers, print any of them.

Examples

Input

3


Output

1 1 1


Input

13


Output

2 3 8


import java.io.*;
import java.util.*;


public class CF {
	
	static class Pair{
	int x,y;
	public Pair(int a, int b) {
		this.x=a;
		this.y=b;
	}
}

	static class in {
	    static BufferedReader reader;
	    static StringTokenizer tokenizer;

	    /** call this method to initialize reader for InputStream */
	    static void init(InputStream input) {
	        reader = new BufferedReader(
	                     new InputStreamReader(input) );
	        tokenizer = new StringTokenizer("");
	    }

	    /** get next word */
	    static String next() throws IOException {
	        while ( ! tokenizer.hasMoreTokens() ) {
	            //TODO add check for eof if necessary
	            tokenizer = new StringTokenizer(
	                   reader.readLine() );
	        }
	        return tokenizer.nextToken();
	    }

	    static int nextInt() throws IOException {
	        return Integer.parseInt( next() );
	    }
		
	    static double nextDouble() throws IOException {
	        return Double.parseDouble( next() );
	    }
	    static long nextLong() throws IOException {
	        return Long.parseLong( next() );
	    }
	}
	
	public static int[] ini(int n)throws IOException {
		
		int[] arr=new int[n];
		for(int i=0;i<n;i++) {
			arr[i]=in.nextInt();
		}
		return arr;
		
	}
	
	public static long[] inl(int n)throws IOException {
		
		long[] arr=new long[n];
		for(int i=0;i<n;i++) {
			arr[i]=in.nextLong();
		}
		return arr;
		
	}
	
	public static int gcd(int a, int b) {
		if(b==0) {
			return a;
		}
		return gcd (b,a%b);
	}
	public static long gcd(long a, long b) {
		if(b==0) {
			return a;
		}
		return gcd (b,a%b);
	}
	public static int lcm(int a, int b) {
		return (a*b)/gcd(a,b);
	}
	public static int max(int[] arr) {
		int max=Integer.MIN_VALUE;
		for(int i=0;i<arr.length;i++) {
			max=Math.max(max, arr[i]);
		}
		return max;
	}
	
	public static long max(long[] arr) {
		long max=Long.MIN_VALUE;
		for(int i=0;i<arr.length;i++) {
			max=Math.max(max, arr[i]);
		}
		return max;
	}
	public static int min(int[] arr) {
		int min=Integer.MAX_VALUE;
		for(int i=0;i<arr.length;i++) {
			min=Math.min(min, arr[i]);
		}
		return min;
	}
	
	public static long min(long[] arr) {
		long min=Long.MAX_VALUE;
		for(int i=0;i<arr.length;i++) {
			min=Math.min(min, arr[i]);
		}
		return min;
	}
	
	public static void reverse(int[] arr, int low, int high) {
		
		int temp;
        while (low<high) {
            temp = arr[low];
            arr[low] = arr[high];
            arr[high] = temp;
            low++;
            high--;
        }
		
	}
	public static void reverse(long[] arr, int low, int high) {
		
		long temp;
        while (low<high) {
            temp = arr[low];
            arr[low] = arr[high];
            arr[high] = temp;
            low++;
            high--;
        }
		
	}
	public static int binarySearch(int arr[], int l, int r, int x)
    {
        if (r >= l) {
            int mid = l + (r - l) / 2;
  
            if (arr[mid] == x)
            	return mid;
           
            if (arr[mid] > x)
                return binarySearch(arr, l, mid - 1, x);
  
            return binarySearch(arr, mid + 1, r, x);
        }

        return -1;
    }
	
	public static void swap(char[] arr, int i, int j) {
		
		char x=arr[i];
		arr[i] = arr[j];
		arr[j] = x;
	}
	
	
	public static ArrayList<Integer> sieveOfEratosthenes(int n)
    {
        boolean prime[] = new boolean[n + 1];
        for (int i = 0; i <= n; i++)
            prime[i] = true;
 
        for (int p = 2; p * p <= n; p++)
        {
           
            if (prime[p] == true)
            {
                
                for (int i = p * p; i <= n; i += p)
                    prime[i] = false;
            }
        }

       ArrayList<Integer> lol=new ArrayList<Integer>();
       
       for(int i=2;i<=n;i++) {
    	   if(prime[i] ==true) {
    		   lol.add(i);
    	   }
       }
       
       return lol;
    }
	
	
	static boolean isPrime(int n)
    {
    
        if (n <= 1) return false;
     
        
        for (int i = 2; i < Math.sqrt(n); i++)
            if (n % i == 0)
                return false;
     
        return true;
    }

	
	
	
	
	
	
	
	/**************************************************************************************/
	
	static int countDigit(long  n)
	{
	    int count = 0;
	    while (n != 0)
	    {
	        n = n / 10;
	        ++count;
	    }
	    return count;
	}
	
	
	
	public static void solve() {
		
	}
	
public static void merge(int[] s1, int[] s2, int[] des){
        
        int i=0;
        int j=0;
        int k=0;
        
        while(i<s1.length && j<s2.length){
            if(s1[i]<=s2[j]){
                des[k]=s1[i];
                i++;
            }
            
            else{
                des[k]=s2[j];
                j++;
            }
            k++;
        }
        
        if(i<s1.length){
            while(i<s1.length){
                des[k]=s1[i];
                i++;
                k++;
            }
        }
        if(j<s2.length){
            while(j<s2.length){
                des[k]=s2[j];
                j++;
                k++;
            }
        }
        
    }

    public static void mergeSort(int[] input){
        
        
        // Write your code here
       if(input.length<=1){
           return;
       }
        
        int[] s1=new int[input.length/2];
        int[] s2=new int[input.length-s1.length];
        
        for(int i=0;i<s1.length;i++){
            s1[i]=input[i];
        }
        
        for(int i=s1.length;i<input.length;i++){
            s2[i-s1.length]=input[i];
        }
        
        mergeSort(s1);
        mergeSort(s2);
        merge(s1,s2,input);
        
        
        
        
    }
	
	
	
	

	public static void main(String[] args)throws IOException {
		// TODO Auto-generated method stub
		in.init(System.in);
		PrintWriter pw=new PrintWriter(System.out);
		
		int n=in.nextInt();
		
		pw.println(0+" "+0+" "+n);
			
			
			
			
		
			
		
		
		
		pw.flush();
		
		pw.close();
		
	}

}
