#include <vector>
#include <list>
#include <algorithm>
using namespace std;

bool CheckA(const vector<int>& v,const list<vector<int> >& l)
{
	list<vector<int> >::const_iterator	i;
    vector<int>							w(v.size()),ww(v.size());
    int									j,k;
    for (i=l.begin();i != l.end();++i) {
    	const vector<int>&	vv = *i;
		copy(vv.begin(),vv.end(),w.begin());
        for (j=0;j<3;++j) {
			copy(w.begin(),w.end(),ww.begin());
	    	for (k=0;k<v.size();++k)
            	w[8-ww[k]] = k+1;
			if (equal(v.begin(),v.end(),w.begin())) return false;
        }
    	reverse_copy(vv.begin(),vv.end(),w.begin());
    	if (equal(v.begin(),v.end(),w.begin())) return false;
    	transform(vv.begin(),vv.end(),w.begin(),bind1st(minus<int>(),9));
    	if (equal(v.begin(),v.end(),w.begin())) return false;
    }
	return true;
}

bool Check(const vector<int>& v)
{
	int		i,j,n=v.size();
    for (i=0;i<n;++i) {
    	for(j=i+1;j<n;++j) {
        	if (v[j] == v[i]+j-i || v[j] == v[i]-j+i)
            	return false;
        }
    }
    return true;
}

int main()
{
	vector<int>			v(8);
    list<vector<int> >	l;
    int					i,n=0;
    for (i=0;i<v.size();++i) v[i] = i+1;
    do {
    	if (Check(v) && CheckA(v,l)) {
        	l.push_back(v);
        	cout << ++n << " ";
        	copy(v.begin(),v.end(),ostream_iterator<int>(cout));
            cout << endl;
        }
    } while (next_permutation(v.begin(),v.end()));
	return 0;
}

//---------------------------------------------------------------------------