#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
int N;
void solve()
{
	cin >> N;
	vector<pair<int,pair<int,int>>> vp;
	for(int i = 1;i <= N;i++)for(int j = i;j <= N && j <= N-i-j;j++) vp.push_back(make_pair(i,make_pair(j,N-i-j)));
	sort(vp.begin(),vp.end());
	for(int i = 0;i < (int)vp.size();i++) cout << vp[i].first << " " << vp[i].second.first << " " << vp[i].second.second << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}