A company manufactures different types of software products. They deliver their products to their N clients. Whenever the company fulfills the complete order of a client, the order ID generated is the concatenation of the number of products delivered for every committed product type. The head of the sales team wishes to find the clientwise data for the total number of products of any type delivered to every client. Write an algorithm for the head of sales team to calculate the total number of products of any type delivered to the respective clients. Input The first line of the input consists of an integer numOfClients, representing the number of clients (N). The second line consists of N space-separated integers- orderID orderID...orderiDN representing the orderIDs of the orders delivered to the clients. Output Print N space-seperated integers representing the clientwise data for the total number of products of any type delivered to each of the respective clients. Constraints 0 ≤ numOfClients ≤ 1000000 orderiD ≤ 1000000 0≤1 numOfClients Example Input: 4 43 345 20 987 Output: 7 12 2 24​