long[] Increasing(int n){
		if(n <= 1){
			return new long[]{0,1,1,1,1,1,1,1,1,1};
		}
		long[] a = Increasing(n-1);
		long[] b = new long[10];
		for(int i = 9; i >= 0; i--){
			for(int j = 0; j <= i; j++){
				b[i] += a[j];
			}
		}
		return b;
	}