#include <iostream>
#include <unordered_map>
using namespace std;

int main() {
    int n;
    cin >> n;
    unordered_map<int, int> cnt;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        for (auto it = cnt.begin(); it!= cnt.end(); it++) {
            int x = a & it->first;
            if (x > a ^ it->first) {
                ans += it->second;
            }
        }
        cnt[a]++;
    }
    cout << ans << endl;
    return 0;
}