Print all subsets of a set $S$, which contains $0, 1, ... n-1$ as elements. Note that we represent $0, 1, ... n-1$ as 00...0001, 00...0010, 00...0100, ..., 10...0000 in binary respectively and the integer representation of a subset is calculated by bitwise OR of existing elements.

Constraints

* $1 \leq n \leq 18$

Input

The input is given in the following format.


$n$


Output

Print subsets ordered by their decimal integers. Print a subset in a line in the following format.


$d$: $e_0$ $e_1$ ...


Print ':' after the integer value $d$, then print elements $e_i$ in the subset in ascending order. Seprate two adjacency elements by a space character.

Example

Input

4


Output

0:
1: 0
2: 1
3: 0 1
4: 2
5: 0 2
6: 1 2
7: 0 1 2
8: 3
9: 0 3
10: 1 3
11: 0 1 3
12: 2 3
13: 0 2 3
14: 1 2 3
15: 0 1 2 3
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;


#define SIZE 19


int N;
int POW[SIZE];


int main(){

	POW[0] = 1;
	for (int i = 1; i < SIZE; i++){

		POW[i] = POW[i-1]*2;
	}

	scanf("%d",&N);

	printf("0:\n");
	int index = 1;

	for(int state = 1; state < POW[N]; state++){
		printf("%d:",index++);
		for(int loop = 0; loop < N; loop++){
			if(state & (1 << loop)){
				printf(" %d",loop);
			}
		}
		printf("\n");
	}

	return 0;
}


