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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
//#define int long long
using namespace std;

struct Dice
{
	int c[6];	//??????????????????

	Dice() {}

	//c0:???, c1:??????, c2:???, c3:?\\, c4:???, c5:???
	Dice(int c0, int c1, int c2, int c3, int c4, int c5)
	{
		c[0] = c0; c[1] = c1; c[2] = c2; c[3] = c3; c[4] = c4; c[5] = c5;
	}

	void temae()
	{
		int temp = c[0];
		c[0] = c[3]; c[3] = c[5]; c[5] = c[1];
		c[1] = temp;
	}

	void oku()
	{
		int temp = c[0];
		c[0] = c[1]; c[1] = c[5]; c[5] = c[3];
		c[3] = temp;
	}

	//y????????¢??????
	void y_migi()
	{
		int temp = c[1];
		c[1] = c[4]; c[4] = c[3]; c[3] = c[2];
		c[2] = temp;
	}

	//y????????¢??????
	void y_hidari()
	{
		int temp = c[1];
		c[1] = c[2]; c[2] = c[3]; c[3] = c[4];
		c[4] = temp;
	}

	//z????????¢??????
	void z_migi()
	{
		int temp = c[0];
		c[0] = c[4]; c[4] = c[5]; c[5] = c[2];
		c[2] = temp;
	}

	//z????????¢??????
	void z_hidari()
	{
		int temp = c[0];
		c[0] = c[2]; c[2] = c[5]; c[5] = c[4];
		c[4] = temp;
	}

	//1???????????\?????????????????¢??????2????¨????????????´????????????????\\??????????????°3????\\????????????????????????
	void format()
	{
		if (c[0] == 1) {
			;
		} else if (c[1] == 1) {
			oku();
		} else if (c[2] == 1) {
			z_hidari();
		} else if (c[3] == 1) {
			temae();
		} else if (c[4] == 1) {
			z_migi();
		} else if (c[5] == 1) {
			oku();
			oku();
		}

		if (c[1] == 2)
		{
			y_migi();
			y_migi();
		} else if (c[2] == 2) {
			y_migi();
		} else if (c[4] == 2) {
			y_hidari();
		} else if (c[3] == 2) {
			return;
		} else {
			if (c[1] == 3)
			{
				y_migi();
				y_migi();
			} else if (c[2] == 3) {
				y_migi();
			} else if (c[4] == 3) {
				y_hidari();
			}
		}
	}

	bool operator == (const Dice &d) const {
		Dice td1 = Dice(c[0], c[1], c[2], c[3], c[4], c[5]);
		Dice td2 = d;

		td1.format();
		td2.format();

		rep(i,6)
		{
			if (td1.c[i] != td2.c[i]) return false;
		}
		return true;
	}
};

int n;
map<string, int> c2n;
string color[6];
int cc[6];
Dice d[30];
bool used[30];

signed main()
{
	c2n["Red"] = 1;
	c2n["Yellow"] = 2;
	c2n["Blue"] = 3;
	c2n["Magenta"] = 4;
	c2n["Green"] = 5;
	c2n["Cyan"] = 6;

	while (true)
	{
		cin >> n;
		if (n == 0) break;

		rep(j,n)
		{
			rep(i,6) cin >> color[i];
			cc[0] = c2n[color[0]];
			cc[1] = c2n[color[1]];
			cc[2] = c2n[color[2]];
			cc[3] = c2n[color[4]];
			cc[4] = c2n[color[3]];
			cc[5] = c2n[color[5]];
			d[j] = Dice(cc[0], cc[1], cc[2], cc[3], cc[4], cc[5]);
		}

		rep(i,n) used[i] = false;

		int ans = 0;
		for (int i=0; i<n; i++)
		{
			for (int j=i+1; j<n; j++)
			{
				if (d[i] == d[j] && used[j] = false;)
				{
					ans++;
					used[j] = true;
				}
			}
		}

		cout << ans << endl;
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <tuple>
#include <set>
#include <string>

using namespace std;

#define int long long

signed main() {
	map<char, int> colorID;
	colorID.emplace('R', 0);
	colorID.emplace('Y', 1);
	colorID.emplace('B', 2);
	colorID.emplace('M', 3);
	colorID.emplace('G', 4);
	colorID.emplace('C', 5);

	while (true) {
		int n;
		cin >> n;
		if (n == 0)break;

		vector<vector<int>> colors(n, vector<int>(6));
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 6; j++) {
				string s;
				cin >> s;
				colors[i][j] = colorID[s[0]];
			}

			while (colors[i][0] != 0) {
				int zeroI = 0;
				for (; zeroI < 6; zeroI++) {
					if (colors[i][zeroI] == 0)break;
				}

				if (zeroI == 2 || zeroI == 3 || zeroI == 5) {
					swap(colors[i][3], colors[i][0]);
					swap(colors[i][0], colors[i][2]);
					swap(colors[i][2], colors[i][5]);
				}
				else {
					swap(colors[i][4], colors[i][0]);
					swap(colors[i][0], colors[i][1]);
					swap(colors[i][1], colors[i][5]);
				}
			}

			int sideMin = min(
				min(colors[i][1], colors[i][2]),
				min(colors[i][3], colors[i][4]));
			while (colors[i][1] != sideMin) {
				swap(colors[i][1], colors[i][2]);
				swap(colors[i][2], colors[i][4]);
				swap(colors[i][4], colors[i][3]);
			}
		}

		set<vector<int>> color_set;
		for (int i = 0; i < n; i++)color_set.emplace(colors[i]);

		cout << n - color_set.size() << endl;
	}
}

C++: #include <iostream>
#include <map>
#include <string>
#include <set>
using namespace std;
class Dice {
public:
  int c[6];
  bool operator <(const Dice &d) const {
    for(int i = 0; i < 6; i++) {
      if(c[i] != d.c[i]) return c[i] < d.c[i];
    }
    return false;
  }

  void sort() {
    for(int i = 0; i < 6; i++) {
      if(c[i] == 0) {
	switch(i) {
	case 0: break;
	case 1: rotateY(-1); break;
	case 2: rotateX(-1); break;
	case 3: rotateX(1); break;
	case 4: rotateY(1); break;
	case 5: rotateX(2); break;
	}
	break;
      }
    }
    int minc = 9999;
    int pos;
    for(int i = 1; i <= 4; i++) {
      if(c[i] < minc) {
	minc = c[i];
	pos = i;
      }
    }
    switch(pos) {
    case 1: break;
    case 2: rotateZ(-1); break;
    case 3: rotateZ(1); break;
    case 4: rotateZ(2); break;
    }
  }

  void rotateX(int dx) {
    int d = 1;
    if(dx < 0) {
      d *= -1;
      dx *= -1;
    }
    for(int i = 0; i < dx; i++) {
      int tmp;
      if(d > 0) {
	tmp = c[0];
	c[0] = c[3];
	c[3] = c[5];
	c[5] = c[2];
	c[2] = tmp;
      } else {
	tmp = c[0];
	c[0] = c[2];
	c[2] = c[5];
	c[5] = c[3];
	c[3] = tmp;
      }
    }
  }
  void rotateY(int dy) {
    int d = 1;
    if(dy < 0) {
      d *= -1;
      dy *= -1;
    }
    for(int i = 0; i < dy; i++) {
      int tmp;
      if(d > 0) {
	tmp = c[0];
	c[0] = c[4];
	c[4] = c[5];
	c[5] = c[1];
	c[1] = tmp;
      } else {
	tmp = c[0];
	c[0] = c[1];
	c[1] = c[5];
	c[5] = c[4];
	c[4] = tmp;
      }
    }
  }
  void rotateZ(int dz) {
    int d = 1;
    if(dz < 0) {
      d *= -1;
      dz *= -1;
    }
    for(int i = 0; i < dz; i++) {
      int tmp;
      if(d > 0) {
	tmp = c[1];
	c[1] = c[3];
	c[3] = c[4];
	c[4] = c[2];
	c[2] = tmp;
      } else {
	tmp = c[1];
	c[1] = c[2];
	c[2] = c[4];
	c[4] = c[3];
	c[3] = tmp;
      }
    }
  }
};



int main() {
  map<string, int> color;
  color["Red"] = 0;
  color["Yellow"] = 1;
  color["Blue"] = 2;
  color["Magenta"] = 3;
  color["Green"] = 4;
  color["Cyan"] = 5;

  while(1) {
    int n;
    set<Dice> s;
    Dice dice;
    cin >> n;
    if(n == 0) break;
    for(int i = 0; i < n; i++) {
      for(int j = 0; j < 6; j++) {
	string str;
	cin >> str;
	dice.c[j] = color[str];
      }
      dice.sort();
      s.insert(dice);
    }
    cout << n - s.size() << endl;
  }
  return 0;
}