Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
		"reflect"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	// 上面の色を固定してから、左右方向に回転して一致するものがあるかを調べる
	round := [][]int{
		{1,2,3,4,5,6}, {1,3,5,2,4,6}, {1,4,2,5,3,6}, {1,5,4,3,2,6}, // c1を上面に固定して回転
		{2,6,3,4,1,5}, {2,3,1,6,4,5}, {2,1,4,3,6,5}, {2,4,6,1,3,5}, // c2を上面に固定して回転
		{3,1,2,5,6,4}, {3,2,6,1,5,4}, {3,5,1,6,2,4}, {3,6,5,2,1,4}, // c3を上面に固定して回転
		{4,1,5,2,6,3}, {4,2,1,6,5,3}, {4,5,6,1,2,3}, {4,6,2,5,1,3}, // c4を上面に固定して回転
		{5,1,3,4,6,2}, {5,3,6,1,4,2}, {5,4,1,6,3,2}, {5,6,4,3,1,2}, // c5を上面に固定して回転
		{6,2,4,3,5,1}, {6,3,2,5,4,1}, {6,5,3,4,2,1}, {6,4,5,2,3,1}, // c6を上面に固定して回転

	}
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		cubes := make([][]string, n)
		for i := 0; i < n; i++ {
			scanner.Scan()
			cubes[i] = strings.Split(scanner.Text(), " ")
		}
		check := func(a, b int) bool {
			tmp := make([]string, 6)
			for i := 0; i < 24; i++ {
				for j := 0; j < 6; j++ {
					tmp[j] = cubes[b][round[i][j]-1]
				}
				if reflect.DeepEqual(tmp, cubes[a]) {
					return true
				}
			}
			return false
		}
		tbl := make([]int, n)
		// 全ての組み合わせを調べる
		for i := 0; i < n; i++ {
			if tbl[i] == 1 {
				continue
			}
			for j := i+1; j < n; j++ {
				if check(i, j) {
					tbl[j] = 1
				}
			}
		}
		fmt.Println(sum(tbl))
	}
}

func sum(a []int) int {
	ret := 0
	for _, v := range a {
		ret += v
	}
	return ret
}

C++: #include <iostream>
#include <vector>

using namespace std;

enum Color {
    Red, Yellow, Blue,
    Magenta, Green, Cyan
};

struct Dice {
    Color dice[6];
};

bool Rotate(const Dice &a, Dice &b, int d)
{
    if (d == 1) {
        swap(b.dice[0], b.dice[4]);
        swap(b.dice[0], b.dice[1]);
    }
    else if (d == 2) {
        swap(b.dice[0], b.dice[3]);
        swap(b.dice[0], b.dice[2]);
        swap(b.dice[2], b.dice[5]);
    }
    else if (d == 3) {
        swap(b.dice[0], b.dice[2]);
        swap(b.dice[0], b.dice[5]);
        swap(b.dice[0], b.dice[3]);
    }
    else if (d == 4) {
        swap(b.dice[0], b.dice[1]);
        swap(b.dice[0], b.dice[4]);
    }
    else if (d == 5) {
        swap(b.dice[0], b.dice[5]);
        swap(b.dice[2], b.dice[3]);
    }

    if (a.dice[5] != b.dice[5])
        return false;

    for (int i = 0; i < 3; ++i) {
        bool flag = true;
        for (int j = 0; j < 6; ++j)
            if (a.dice[j] != b.dice[j]) {
                flag = false;
                break;
            }
        if (flag)
            return true;

        for (int j = 1; j <= 3; ++j)
            swap(b.dice[j], b.dice[j + 1]);
    }

    return false;
}

bool isSame(const Dice &a, Dice &b)
{
    for (int i = 0; i < 6; ++i)
        if (a.dice[0] == b.dice[i]) {
            if (Rotate(a, b, i))
                return true;
        }

    return false;
}

int main()
{
    int n;

    while (cin >> n, n) {
        Dice obj[n];
        string inp;

        for (int i = 0; i < n; ++i)
            for (int j = 0; j < 6; ++j) {
                cin >> inp;

                if (inp == "Red")
                    obj[i].dice[j] = Red;
                else if (inp == "Yellow")
                    obj[i].dice[j] = Yellow;
                else if (inp == "Blue")
                    obj[i].dice[j] = Blue;
                else if (inp == "Magenta")
                    obj[i].dice[j] = Magenta;
                else if (inp == "Green")
                    obj[i].dice[j] = Green;
                else if (inp == "Cyan")
                    obj[i].dice[j] = Cyan;
            }

        vector<bool> used(n, false);
        int same = 0;
        for (int i = 0; i < n; ++i) {
            if (!used[i])
                for (int j = i + 1; j < n; ++j) {
                    if (isSame(obj[i], obj[j])) {
                        used[j] = true;
                        ++same;
                    }
                }
        }

        cout << same << endl;
    }

    return 0;
}

C++: //26
#include<iostream>
#include<set>
#include<string>
#include<vector>

using namespace std;

vector<string> rot(vector<string> d,int a,int b,int c,int x){
  string t=d[a];
  d[a]=d[b];
  d[b]=d[c];
  d[c]=d[x];
  d[x]=t;
  return d;
}

vector<string> rotu(vector<string> d){
  return rot(d,0,1,5,4);
}

vector<string> rotr(vector<string> d){
  return rot(d,3,0,2,5);
}

vector<string> roth(vector<string> d){
  return rot(d,1,2,4,3);
}

int main(){
  for(int n;cin>>n,n;){
    set<vector<string> > s;
    for(int i=0;i<n;i++){
      vector<string> d(6);
      for(int j=0;j<6;j++){
	cin>>d[j];
      }
      for(int j=0;j<6;j++){
	if(j%2){
	  d=rotu(d);
	}else{
	  d=rotr(d);
	}
	for(int k=0;k<4;k++){
	  d=roth(d);
	  s.insert(d);
	}
      }
    }
    cout<<n-s.size()/24<<endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>

using namespace std;

#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))

typedef complex<double> P;
typedef pair<P,P> Edge;
typedef long long ll;

//ifstream ifs("input.txt");
//#define cin ifs

// 24ñÅ³ÉàÇé
class Dice{
private:
  int yoko;
  int tate;
  int round;

private:
    int face[3][4];

public:
  int getFace(const int idx)const{
    if(idx==0)
      return face[1][1];
    else if(idx==1)
      return face[2][1];
    else if(idx==2)
      return face[1][2];
    else if(idx==3)
      return face[1][0];
    else if(idx==4)
      return face[0][1];
    else if(idx==5)
      return face[1][3];
    return -1;
  }
  Dice(const vector<int> &v){
    init();
    face[1][1]=v[0];
    face[2][1]=v[1];
    face[1][2]=v[2];
    face[1][0]=v[3];
    face[0][1]=v[4];
    face[1][3]=v[5];
  }
private:
  // _CXÌú»
  void init(){
	  for(int i=0;i<3;i++)for(int j=0;j<4;j++)face[i][j]=-1;
    yoko=0;
    tate=0;
    round=0;
  }
public:
  // _CXÌñ]
  void rotate(){
    if(round<4){
    	int tmp = face[2][1];
    	face[2][1]=face[1][2];
    	face[1][2]=face[0][1];
    	face[0][1]=face[1][0];
    	face[1][0]=tmp;
    	round++;
    }
    if(round>=4){
    	round=0;
    	// àÇÁÄ«½çA¡ÌXbgðñ]³¹é
    	if(yoko<4){
    		int tmp = face[1][3];
    		for(int i = 2; i >= 0; i--){
    			face[1][i+1]=face[1][i];
    		}
    		face[1][0]=tmp;
    		yoko++;
    	}
    	// àÇÁÄ«½çAcÌXbgðñ]³¹é
    	if(yoko>=4){
    		if(tate<4){
    			tate++;
    			int tmp = face[1][3];
    			face[1][3]=face[0][1];
    			for(int i = 0; i < 2; i++){
    				face[i][1]=face[i+1][1];
    			}
    			face[2][1]=tmp;
    		}
    		if(tate>=4){
    			round=0;
    			tate=0;
    			yoko=0;
    		}
    	}
    }
  };
};

int main(){
	int n;
	while(cin>>n&&n!=0){
		map<string,int> dict;
		dict["Cyan"]=0;
		dict["Yellow"]=1;
		dict["Red"]=2;
		dict["Magenta"]=3;
		dict["Green"]=4;
		dict["Blue"]=5;
		vector<Dice> vd;
		for(int i=0;i<n;i++){
			vector<int> vs;
			for(int j=0;j<6;j++){
				string s;
				cin>>s;
				vs.push_back(dict[s]);
			}
			vd.push_back(Dice(vs));
		}
		int cnt=0;
		// ¡ÜÅÉo»µ½p^[ðo^
		set<vector<int> > svs;
		for(int i=0;i<n;i++){
			Dice &dice=vd[i];
			vector<int> vs2;
			// ¡ñÌÊðÂ­é
			for(int k=0;k<6;k++)
				vs2.push_back(dice.getFace(k));
			// ±ÌÊª¡ÜÅo»µÄ¢êÎAcontinue
			if(svs.find(vs2)!=svs.end())continue;
			// »¤ÅÈ¯êÎAJEgðâ·
			cnt++;
			// ¡ñÌ_CXÌSu«ûðo^
			for(int j=0;j<28;j++){
				vector<int> vs;
				for(int k=0;k<6;k++)
					vs.push_back(dice.getFace(k));
				// u«ûðo^
				svs.insert(vs);
				// _CXðñ]
				dice.rotate();
			}
		}
		// o»µ½p^[ÌðAn©çø­
		cout<<n-cnt<<endl;
	}
	return 0;
}