#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n;

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n;
	vector<pair<int, P> > v;
	for (int c = 1; c <= n; c++) {
		for (int b = 1; b <= c; b++) {
			int a = n-b-c;
			if (1 <= a && a <= b) v.push_back({a, {b, c}});
		}
	}
	sort(ALL(v));
	FOR(i, v.size()) cout << v[i].first << " " << v[i].second.first << " " << v[i].second.second << endl;
	return 0;
}