There are N strings whose length are exactly 10. And all the strings consists of exactly one 'x' and some '0' or/and '1'.
You need to answer how many kinds of strings are there.
Note: be careful of the efficiency of your strategy. And we don't suggest you to solve this problem by sorting.
The first line contains one integers N (1 ≤ N ≤ 105) – the number of the strings.
Then N lines follow. The i+1-th line contains one integers Si – the i-th string you are given.
Output how many kinds of strings are there and then output a newline('\n').