A harbor traffic-control station keeps a short roster of registered beacon codes used to identify vessel classes. When a ship approaches, its transponder broadcasts a single signal string. A registered beacon code is "recognized" for that broadcast if the code's letters exactly match the beginning (a prefix) of the broadcast signal string. Given the roster of beacon codes and one broadcast signal, determine how many roster entries are recognized.

Input format

• Line 1: an integer n, the number of registered beacon codes.
• Lines 2 through n+1: one beacon code per line, each a non-empty string of lowercase English letters.
• Final line: the broadcast signal string s, a non-empty string of lowercase English letters.

Output format

Print a single integer: the number of beacon codes that are a prefix of s.

Constraints

• 1 <= n <= 1000
• 1 <= length of each beacon code <= 10
• 1 <= length of s <= 10
• All strings consist only of lowercase English letters.
• Beacon codes may repeat in the roster; each occurrence is counted independently.

6
a
b
c
ab
bc
abc
abc

3

2
a
a
aa

2