Input SET is played with a special deck of cards. Each card has four attributes: 1. Color 2. Symbol 3. Shading (of symbols) 4. Number of symbols) Each attribute has three potential values and each card is unique, so there are a total of 81 (34) possible cards. In the input to our program, the four attributes of a SET card will be represented as follows: 1. Color -- one of the words "blue", "green", or "yellow" 2. Symbol -- the three symbols will be represented by the letters A, S, and H 3. Shading - the shading of the symbols will be represented by the case of the letter: one of lower-case (a,s,h), upper-case (A, S, H), or "symbol-case" (@. $. #) 4. Number -- the letter will appear one, two, or three times For example, possible SET cards include: yellow S -- one Yellow upper-case S blue aaa -- three Blue lower-case A's green ## -- two Green symbol-case H's The input to our program will be through standard input (not through a file) and will contain an integer N, with 3

Input SET is played with a special deck of cards. Each card has four attributes: 1. Color 2. Symbol 3. Shading (of symbols) 4. Number of symbols) Each attribute has three potential values and each card is unique, so there are a total of 81 (34) possible cards. In the input to our program, the four attributes of a SET card will be represented as follows: 1. Color -- one of the words "blue", "green", or "yellow" 2. Symbol -- the three symbols will be represented by the letters A, S, and H 3. Shading - the shading of the symbols will be represented by the case of the letter: one of lower-case (a,s,h), upper-case (A, S, H), or "symbol-case" (@. $. #) 4. Number -- the letter will appear one, two, or three times For example, possible SET cards include: yellow S -- one Yellow upper-case S blue aaa -- three Blue lower-case A's green ## -- two Green symbol-case H's The input to our program will be through standard input (not through a file) and will contain an integer N, with 3