Problem Statement  
Let's consider a standard sixsided die. Each side contains a distinct number between 1 and 6. We can represent a single die as a sequence of 6 digits in the following order: the number on its top side, bottom side, left, right, front and back sides. You are given a String[] givenDice, each element of which represents a single die in the described format. Your task is to determine the number of distinct dice in givenDice. Two dice are considered equal if they can be rotated in such a way that the numbers on the corresponding sides are all equal.  
Definition  
 
Constraints  
  givenDice will contain between 1 and 50 elements, inclusive.  
  Each element of givenDice will contain exactly 6 characters.  
  Each character of each element of givenDice will be a digit between '1' and '6', inclusive.  
  Within each element of givenDice, all characters will be distinct.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
