B"Suppose you have an integer v . In one operation, you can: You are given n integers a_1, a_2, ... , a_n . What is the minimum number of operations you need to make each a_i equal to 0 ? The first line contains the single integer n ( 1 <= n <= 32768 ) -- the number of integers. The second line contains n integers a_1, a_2, ... , a_n ( 0 <= a_i < 32768 ). Print n integers. The i -th integer should be equal to the minimum number of operations required to make a_i equal to 0 . Let's consider each a_i : "...