#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

set<pair<int,pair<int,int> > > ss;

int main(){
  int n;

  cin >> n;

  for(int i=1;i<n;i++){
    for(int j=i;j+i<n;j++){

      int a[3] = {i,j,n-i-j};
      sort(a,a+3);

      if(ss.find({a[0],{a[1],a[2]}}) == ss.end()){
        ss.insert({a[0],{a[1],a[2]}});
        printf("%d %d %d\n",i,j,n-i-j);
      }
    }
  }
  
  
  
  return 0;
}