Santa Claus has n candies, he dreams to give them as gifts to children.

What is the maximal number of children for whose he can give candies if Santa Claus want each kid should get distinct positive integer number of candies. Santa Class wants to give all n candies he has.

Input

The only line contains positive integer number n (1 ≤ n ≤ 1000) — number of candies Santa Claus has.

Output

Print to the first line integer number k — maximal number of kids which can get candies.

Print to the second line k distinct integer numbers: number of candies for each of k kid. The sum of k printed numbers should be exactly n.

If there are many solutions, print any of them.

Examples

Input

5


Output

2
2 3


Input

9


Output

3
3 5 1


Input

2


Output

1
2 
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Map.Entry;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.Vector;
 
 
public class Main {
	static double[]a;
	static int dp[][]=new int[1000+3][1000+3];
	public static void main(String[] args) throws IOException{
		  	FastScanner sc = new FastScanner();
			PrintWriter out = new PrintWriter(System.out);
			int n =sc.nextInt();
			for(int i=0;i<dp.length;i++)Arrays.fill(dp[i], -1);
			
			System.out.println(solve(n,1));
			print(n,1);

		
	}
	public static int solve(int n,int i ){
		if(n==0)return 0;
		if(i>n)return Integer.MIN_VALUE;
		if(n<0)return Integer.MIN_VALUE;
		if(dp[n][i]!=-1)return dp[n][i];
		int c1 = 1+solve(n-i,i+1);
		int c2 = solve(n,i+1);
		return dp[n][i]=Math.max(c1, c2);
	}
	
	public static void print(int n,int i ){
		if(n==0)return ;
		if(i>n)return ;
		if(n<0)return ;
		
			
			int c1 = 1+solve(n-i,i+1);
			int c2 = solve(n,i+1);	
		int optimal = solve(n,i);
		if(optimal==c1){
			System.out.print(i+" ");
			print(n-i,i+1);
			return;
		}
		else{
			print(n,i+1);
		}
		return;
	}
	


		
	
			
		
	

			

			
			
			
	
	



	
	
			    
			


			
			
	
	
	

			
	
		
	
	
	
		

			

		

	
	

	
	
	

			
						
			

	
	

		
		
		


















































	static void shuffle(int[] a)
	{
		int n = a.length;
		for(int i = 0; i < n; ++i)
		{
			int r = i + (int)(Math.random() * (n - i));
			int tmp = a[r];
			a[r] = a[i];
			a[i] = tmp;
		}
	}


	static void generate(int[] p, int L, int R) {
		  if (L == R) {
		      
		      
		  }else { 
		    for (int i = L; i <= R; i++) {
		    	int tmp = p[L]; p[L] = p[i]; p[i] = tmp;//swap
		      generate(p, L+1, R);//recurse 
		      tmp = p[L]; p[L] = p[i]; p[i] = tmp;//unswap

		    }
		  }
		}


















































































































	
}
	 


	class point implements Comparable{
		int x ;int y ;
		point(int x ,int y){
			this.x=x;
			this.y=y;
		}
		@Override
		public int compareTo(Object arg0) {
			// TODO Auto-generated method stub
			point p = (point)arg0;
			if(p.x>this.x)return -1;
			if(p.x<this.x)return 1;
			return 0;
		}
		
	}
	
	
	











	
 
 
 

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
class FastScanner {
 
 
 
 
    BufferedReader br;
    StringTokenizer st;
 
    public FastScanner() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }
 
    public FastScanner(String s) {
        try {
            br = new BufferedReader(new FileReader(s));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
    }
 
    String nextToken() {
        while (st == null || !st.hasMoreElements()) {
            try {
 
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
 
    int nextInt() {
        return Integer.parseInt(nextToken());
    }
 
    long nextLong() {
        return Long.parseLong(nextToken());
    }
 
    double nextDouble() {
        return Double.parseDouble(nextToken());
    }
 
 
}

