#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	cout<<-1<<endl;
	return;
	vector<int> V;
	FOR(i,N) FOR(j,3) V.push_back(i);
	
	do {
		vector<int> v[10]={};
		FOR(i,V.size()) v[V[i]].push_back(i);
		
		int ok=1;
		FOR(i,V.size()/3) {
			if(abs((v[i][1]-v[i][0])-(v[i][2]-v[i][1]))!=i) ok=0;
		}
		if(ok) {
			FORR(v,V) cout<<v;
			cout<<endl;
		}
		
		
	} while(next_permutation(ALL(V)));
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}