SOS Bit Problem

Given a list of n integers, your task is to calculate for each element x: - the number of elements y such that x \mid y = x - the number of elements y such that x \mathrel{\&} y = x - the number of elements y such that x \mathrel{\&} y \neq 0 Input The first line has an integer n: the size of the list. The next line has n integers x_1,x_2,\dots,x_n: the elements of the list. Output Print n