#include <iostream>
using namespace std;

int n, qu[20], pos = 1;

void subsets() {
  for (int i = 1; i <= pos; i++ ){
    cout << qu[i] << " ";
  }
  cout << '\n';

  if (pos == 1 && qu[pos] == n) {
    return;
  } else if (pos != 1 &&  qu[pos] == n) {
    qu[pos - 1]++;
    pos--;
    subsets();
  } else {
    pos++;
    qu[pos] = qu[pos - 1] + 1;
    subsets();
  }
}

int main() {
  cin >> n;
  qu[pos] = 1;
  subsets();
}