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>
using namespace std;

int main(){
  cin.tie(0);
 	ios::sync_with_stdio(false);
  int n;
  cin >> n;
  bitset<18> a[n];
  for(int i = 0; i < n; i++){
    a[i][i] = 1;
  }
  vector<vector<int>> v((1 << n));
  for(int x = 1; x < (1 << n); x++){
    bitset<18> b(x);
    bitset<18> e(0);
    for(int i = 0; i < 18; i++){
      if(b[i] == 0) continue;
      if(e == 0){
        e = a[i];
      }else{
        e |= a[i];
      }
    }
    int idx = e.to_ulong();
    for(int i = 0; i < 18; i++){
      if(b[i] == 1){
        v[idx].push_back(i);
      }
    }
  }
  for(int i = 0; i < v.size(); i++){
    cout << i << ":";
    for(int j = 0; j < v[i].size(); j++){
      cout << " " << v[i][j];
    }
    cout << "\n";
  }
  return 0;
}

