We’re preparing your current view and syncing the latest data.
You are given N strings representing the names of chefs. Each string consists of lowercase English letters. Your task is to determine the number of different chefs after considering the pattern of their names as defined in the problem. The exact requirement to identify chefs is based on the problem statement on CodeChef under the slug 'manychef'.
The first line contains the integer N, the number of strings. Each of the next N lines contains a string representing a chef's name.
Output a single integer - the count of different chefs according to the problem's criteria.
1 ≤ N ≤ 10^5 1 ≤ length of each string ≤ 10^6