Integer Points

def count_intersections(n, c1, m, c2):
    
    even1 = sum(1 for c in c1 if c % 2 == 0)
    odd1 = n - even1   

    
    even2 = sum(1 for c in c2 if c % 2 == 0)
    odd2 = m - even2   

     
    return even1 * even2 + odd1 * odd2

 
n = int(input())
c1 = list(map(int, input().split()))
m = int(input())
c2 = list(map(int, input().split()))

 
print(count_intersections(n, c1, m, c2))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED