bool cmp(int n1[], int n2[]) {
	int p1 = 0, p2 = -1;
	for (int i = 0;i < 6;i++) {
		if (n2[i] == n1[p1]) {
			p2 = i;
			break;
		}
	}
	if (p2 == -1)return false;
	bool f = true, f2 = true;
	int t1 = p1, t2 = p2;
	do {
		if (n1[t1] != n2[t2]) {
			f = false;
			break;
		}
		t1 = (t1 + 1) % 6;
		t2 = (t2 + 1) % 6;
	} while (t1 != p1);
	t1 = p1;t2 = p2;
	do {
		if (n1[t1] != n2[t2]) {
			f2 = false;
			break;
		}
		t1 = (t1 + 1) % 6;
		t2 = (t2 - 1 + 6) % 6;
	} while (t1 != p1);
	if (f || f2)return true;
	else return false;
}