Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
counter = 0

while A:
    x = A[0]
    if A.count(x) % 2 == 1:
        counter += 1
    A = [i for i in A if i != x]

print(counter)


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
counter = 0
cemetery = []

for i in range(N):
    if not A[i] in cemetery:
        if A.count(A[i]) % 2 == 1:
            counter += 1
        cemetery.append(A[i])

print(counter)


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
array = []

for _ in range(N):
    A = int(input())
    if A in array:
        array.remove(A)
    else:
        array.append(A)

print(len(array))


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
array = []

for _ in range(N):
    A = int(input())
    if A in array:
        array.remove(A)
    else:
        array.append(A)

print(len(array))


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
counter = 0
while A:
    num = A.count(A[0])
    if num % 2 == 1:
        counter += 1
    del A[:num]

print(counter)


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
counter = 0
while A:
    num = A.count(A[0])
    if num % 2 == 1:
        counter += 1
    del A[:num]

print(counter)


Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
counter = 0
while A:
    if A.count(A[0]) % 2 == 1:
        counter += 1
    del A[:A.count(A[0])]

print(counter)

Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
array = []

for _ in range(N):
    A = int(input())
    if A in array:
        array.remove(A)
    else:
        array.append(A)

print(len(array))

Fixed submission:
N = int(input())
maps = {}

for _ in range(N):
    A = int(input())
    if A in maps:
        maps.pop(A)
    else:
        maps[A] = 1

print(len(maps))