Triplets - 2

easy
 1. You are given an array(arr) of N numbers.
2. You have to find the number of triplets whose bitwise AND is equal to zero.
                               

Input Format

A number N arr1 arr2.. n numbers

Output Format

Check the sample ouput and question video.

Constraints

1 <= N <= 1000
0 <= arr[i] <= 2^16

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input
3
2 
1 
3
Output
12
Previous
N Bit Grey Code
Next
Bubble Sort

Related Questions