{"problem":{"name":"Playing Cards Validation","description":{"content":"You are given $N$ strings, each of length $2$, consisting of uppercase English letters and digits. The $i$\\-th string is $S_i$.   Determine whether the following three conditions are all satisfied.   ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc277_b"},"statements":[{"statement_type":"Markdown","content":"You are given $N$ strings, each of length $2$, consisting of uppercase English letters and digits. The $i$\\-th string is $S_i$.  \nDetermine whether the following three conditions are all satisfied.  \n・For every string, the first character is one of `H`, `D`, `C`, and `S`.  \n・For every string, the second character is one of `A`, `2`, `3`, `4`, `5`, `6`, `7`, `8`, `9`, `T`, `J`, `Q`, `K`.  \n・All strings are pairwise different. That is, if $i \\neq j$, then $S_i \\neq S_j$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 52$\n*   $S_i$ is a string of length $2$ consisting of uppercase English letters and digits.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$S_2$\n$\\vdots$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc277_b","tags":[],"sample_group":[["4\nH3\nDA\nD3\nSK","Yes\n\nOne can verify that the three conditions are all satisfied."],["5\nH3\nDA\nCK\nH3\nS7","No\n\nBoth $S_1$ and $S_4$ are `H3`, violating the third condition."],["4\n3H\nAD\n3D\nKS","No"],["5\n00\nAA\nXX\nYY\nZZ","No"]],"created_at":"2026-03-03 11:01:13"}}