#include "bits/stdc++.h"usingnamespacestd;
int n, a[105];
vector< pair<int, int> > v[105];
void Match(int LL, int LR, int RL, int RR, int d) {
if (LR <= LL) return;
int L[50], R[50], cnt = LR - LL;
for (int i = 0; i < cnt; ++i) {
L[i] = a[LL + i]; R[i] = a[RL + i];
v[d].push_back(make_pair(L[i], R[i]));
}
for (int k = 1; k < cnt; ++k) {
for (int i = 0; i < cnt; ++i)
R[i] = RL + (R[i] + k - RL) % cnt;
for (int i = 0; i < cnt; ++i)
v[d + 1].push_back(make_pair(L[i], R[i]));
d = d + 1;
}
Match(LL, (LL + LR) / 2, (LL + LR) / 2, LR, d + 1);
Match(RL, (RL + RR) / 2, (RL + RR) / 2, RR, d + 1);
}
int main() {
scanf("%d", &n);
n = 1 << n;
for (int i = 1; i <= n; ++i)
a[i] = i;
Match(1, n / 2 + 1, n / 2 + 1, n + 1, 1);
for (int i = 1; i < n; ++i) {
printf("<%d>", i);
int size = v[i].size();
for (int k = 0; k < size; ++k)
printf("%s%d-%d", k ? " " : "", v[i][k].first, v[i][k].second);
putchar('\n');
}
return0;
}