#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(int i = 0; i < n; i++)

int main() {
	int N;
	cin >> N;
	function<void(int, int, int)> dfs = [&](int a, int b, int c)
	{
		cout << a << " " << b << " " << c << endl;
		if((a == N / 3 && b + 1 > c - 1)) return;
		if(b+ 1 <= c - 1) dfs(a, b + 1, c - 1);
		else dfs(a + 1, a + 1, N - (a + 1) * 2);
	};
	dfs(1, 1, N - 2);
}