Problem Statement

Count Desktop Product IDs Problem Description A company Digicomparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Every product the company makes carries a unique productID drawn from a-z and A-Z. The laptop line uses the productIDs (a, i, e, o, u, A, I, E, O, U), and all remaining productIDs belong to the desktop line. The sales manager wants to isolate the desktop figures from recent sales data. Given a list of productIDs recorded from the last N sales, write an algorithm that reports the productIDs belonging to the desktop line. Input: The first line of the input consists of an integer numOfProducts , representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ..., productID N representing the product IDs of the sales of the last N products. Output: Print an integer represent