public static long sumXor(long n) {
        // Write your code here
        long count = 0;
        while (n > 0) {
            if ((n & 1) == 0) {
                count++;
            }
            n >>= 1;
        }
        return 1L << count;
    }