Bitwise ANDYou are given n positions and each position has a value associated with it$.$ You can delete only two positions but their Bitwise AND should be greater than k$.$ Determine the numbers of pairs of positions whose Bitwise AND value is greater than k$.$Input format$$ First line: n $($number of positions$)$ Second line: n space$-$separated integers $($value associated with each position$)$ Third line: kOutput formatPrint the numbers of pairs of positions whose Bitwise AND value is greater than kConstraints$2$