Counting ones

#include <iostream>
#include <cmath>
#include <vector>
#include <tuple>
using namespace std;
// #define int long long int


int main() {
    long long q;
    int n;
    vector <long long> x;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> q;
        x.push_back(q);
    }

    int res = 0;
    long long res1, res2;
    int hehe;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            q = x[i] * x[j];
            hehe = __builtin_popcount(q);
            if (hehe > res) {
                res = hehe;
                res1 = x[i];
                res2 = x[j];
            }
        }
    }
    cout << res << endl;
    cout << res1 << " " << res2 << endl;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER