An oceanographic monitoring network deploys lowercase-lettered buoy tags in registration order: 'a', 'b', 'c', ..., 'z'. Long ago the network fixed a binary ping code for every letter, grouped by how early it was registered: the first 2 letters ('a', 'b') each get a 1-bit code, the next 4 ('c' through 'f') each get a 2-bit code, the next 8 ('g' through 'n') each get a 3-bit code, and the final 12 ('o' through 'z') each get a 4-bit code. Within a group, codes are assigned in alphabetical order by counting up in binary from all zeros, so the group's first letter gets the all-zero code of that group's bit-length, its second letter gets that value plus one in binary, and so on.

Written out in full, the fixed table is:

a=0 b=1 c=00 d=01 e=10 f=11 g=000 h=001 i=010 j=011 k=100 l=101 m=110 n=111 o=0000 p=0001 q=0010 r=0011 s=0100 t=0101 u=0110 v=0111 w=1000 x=1001 y=1010 z=1011

A buoy's tag is a string of one or more lowercase letters. Its ping signature is formed by concatenating, in order, the fixed code of every letter in the tag. Because the codes have different lengths, two different tags can occasionally concatenate into the exact same signature string. Given a batch of buoy tags, determine how many distinct ping signatures occur among them.

Input format

Line 1: an integer n, the number of buoy tags. Next n lines: one tag per line, consisting only of lowercase English letters.

Output format

Print a single integer: the number of distinct ping signatures produced by the n tags.

Constraints

1 <= n <= 100 1 <= length of each tag <= 20 Each tag consists only of lowercase English letters 'a'-'z'.

4
ab
d
cd
dc

3

3
z
z
zz

2