#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<29
#define ALEN(ARR) (sizeof(ARR) / sizeof((ARR)[0]))
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define _DEBUG(x) cout<<#x<<": "<<x<<endl
#define _DDEBUG(x,y) cout<<#x<<": "<<x<<", "<<#y<<": "<<y<<endl
#define ll long long
#define ull unsigned long long
#define MOD 1000000007

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.precision(16);

	int n;
	cin >> n;
	
	set<tuple<int, int, int> > before_sort_ans;
	FOR(i, 1, n) {
		FOR(j, i, n) {
			if(n-i-j <= 0) {
				break;
			}
			int array[] = {i, j, n-i-j};
			sort(array, array + 3);
			before_sort_ans.insert(make_tuple(array[0], array[1], array[2]));
		}
	}

	vector<tuple<int, int, int> > ans;
	copy(before_sort_ans.begin(), before_sort_ans.end(), back_inserter(ans));
	sort(ans.begin(), ans.end());

#if DEBUG
	cout << "** RESULT **" << endl; // debug
#endif

	for(tuple<int, int, int> elem : ans) {
		cout << get<0>(elem) << " " << get<1>(elem) << " " << get<2>(elem) << endl;
	}

	
	return 0;
}