Problem:


Score : 300 points

Problem Statement

You are playing the following game with Joisino.

Initially, you have a blank sheet of paper.

Joisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.

Then, you are asked a question: How many numbers are written on the sheet now?

The numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?

Constraints

1≤N≤100000

1≤A_i≤1000000000(=10^9)

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print how many numbers will be written on the sheet at the end of the game.

Sample Input 1

3
6
2
6

Sample Output 1

1

The game proceeds as follows:

6 is not written on the sheet, so write 6.

2 is not written on the sheet, so write 2.

6 is written on the sheet, so erase 6.

Thus, the sheet contains only 2 in the end. The answer is 1.

Sample Input 2

4
2
5
5
2

Sample Output 2

0

It is possible that no number is written on the sheet in the end.

Sample Input 3

6
12
22
16
22
18
12

Sample Output 3

2



Sample input:
3
6
2
6


Sample output:
1

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(n):
	a.append(int(input()))
a.sort()

now=a[0]
odd=0
ans=0
for i in range(n):
	if a[i]==now:
		odd=(odd+1)%2
	else:
		if odd==1:
			ans+=1
		if i+1<n:
			now=a[i+1]
			odd=0
print(ans+odd)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=[]
count=0
for i in range (N):
  a=int(input())
  if a in p:
      count-=1
      p.append(0)
  else:
    p.append(a)
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())
p=[0]
count=0
for i in range (N):
  a=int(input())
  if a in p:
      count-=1
      p.append(0)
  else:
    p.append(a)
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
import collections

N = int(input())
A = [int(input()) for i in range(N)]

count_dict = collections.Counter(A)

count = 0

for i in count_dict.values():
    if i == 1:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
#入力（後でいじる）
def pin(type=int):
    return map(type,input().split())
#どっかで最悪計算量の入力データを用意する関数を作ろう？
"""
バケットで管理したかったけど数字が多いのでソートして同じ数を固めることに
"""
#solution:
#潜 影 蛇 手 ! !
N=int(input())
a=[]
for i in range(N):
    a.append(int(input()))
a.sort()
bac=1
ans=0
for j in range(N-1):
    if a[j+1]!=a[j]:
        ans+=bac%2
        bac=1
    else:
        bac+=1
print(ans)
#print(["NO

Submission status: Wrong Answer

Solution code:
n = int(input())
l = {}
for i in range(n):
  a = int(input())
  if a in l:
    l[a] +=1
  else:
    l[a] = 1
ans = 0
for i in l.values():
    if i % 2 == 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
l = {}
for i in range(n):
  a = int(input())
  if a in l:
    l[a] = 0
  else:
    l[a] = 1
    
print(sum(l.values()))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
numlist = []
for i in range(a):
	b = int(input())
	numlist.append(b)
i = 0
while i < a - 1:
	j = i + 1
	while j < a:
		if numlist[i] == numlist[j]:
			numlist.pop(j)
			a -= 1
		j += 1
	i += 1
print(len(numlist))

Submission status: Wrong Answer

Solution code:
n=int(raw_input())
a=[]
for i in range(0,n,1):
    x=int(raw_input())
    for j in range(0,len(a),1):
        if x == a[j]:
            a.pop(j)
            break
        a.append(x)
    if len(a) == 0:
        a.append(x)
print len(a)

Submission status: Wrong Answer

Solution code:
n = int(input())
na = []
cou = []
count = 0
for i in range(n):
    a = int(input())
    na.append(a)
for j in range(n):
    if na[j] in cou:
        count -= 1
    else:
        count += 1
        cou.append(na[j])
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())


ds = {}
for _ in range(N):
    A = input()
    if A not in ds:
        ds[A] = 0
    else:
        ds[A] += 1
print(ds)
cnt = 0
for d in ds:
    if ds[d] % 2 == 0:
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
d = {}
for i in range(N):
    a = int(input())
    d[a] = 0
    A.append(a)
S = []
for i in range(N):
    if d[A[i]] == 0:
        S.append(A[i])
    d[A[i]] += 1
ans = 0
for i in S:
    ans += (d[i]//2)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
for i in range(N):
    a = int(input())
    A.append(a)
A.sort()
Ans = []
for i in range(N):
    if A[i] in Ans:
        break
    else:
        if A.count(A[i]) % 2 == 1:
            Ans.append(A[i])
print(len(Ans))

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
for i in range(n):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sas=sa
            sa=1
            if sas%2!=0:
                ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
list.append(10000000000)
for i in range(n+1):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sas=sa
            sa=1
            print(list[i-1],sas)
            if sas%2!=0:
                ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
list.append(1000000000)
for i in range(n+1):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sas=sa
            sa=1
            if sas%2!=0:
                ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
list.append(100000000)
print(list)
for i in range(n+1):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sas=sa
            sa=1
            if sas%2!=0:
                ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=1
sas=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
for i in range(n):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sas=sa
            sa=1
            if sas%2!=0:
                ans+=1
if sa==1:
    print(ans+1)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
sa=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
for i in range(n):
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
        else:
            sa=0
    if sa%2!=0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
list=[]
ans=0
for i in range(n):
    a=int(input())
    list.append(a)
list=sorted(list)
for i in range(n):
    sa=0
    if i!=0:
        if list[i]==list[i-1]:
            sa+=1
    if sa%2!=0:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import collections

N = int(input())
lst = [int(input()) for i in range(N)]

cc = dict(collections.Counter(lst))
ans = 0
for i in cc.values():
  if (i == 1):
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
nums = [int(input()) for _ in range(n)]
cnt = {}
for x in nums:
    if x in cnt:
        cnt[x] = 0
    else:
        cnt[x] = 1

print(sum(cnt.values()))

Submission status: Wrong Answer

Solution code:
n=int(input())
a= [int(input()) for i in range(n)] 

a.sort()
ans=0
m=1
print(a)
for i in range(1,n):
    if a[i-1] == a[i]:
        m+=1
    else:
        ans+=(m%2)
        m=1

ans+=(m%2)

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a= [int(input()) for i in range(n)] 

a.sort()
b=0
ans=0

for i in a:
    if b != i:
        ans+=1
    else:
        ans-=1
    b=i
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A = []

for i in range(N):
    new = int(input())
    A.append(new)

A.sort()
A.append(0)

start=A[0]
cnt=1
anscnt=0

for i in range(1,len(A)):

    if A[i]==start:
        cnt+=1
    elif A[i]!=start:
        if cnt%2==0:
            anscnt+=cnt
        cnt=1
        start=A[i]


print(N-anscnt)

Submission status: Wrong Answer

Solution code:
N=int(input())
A = []

for i in range(N):
    new = int(input())
    A.append(new)

A.sort()
A.append(0)

start=A[0]
cnt=1
anscnt=0

for i in range(1,len(A)):

    if A[i]==start:
        cnt+=1
    elif A[i]!=start:
        if cnt%2==0:
            anscnt+=cnt
        cnt=1
        start=A[i]
    

print(N-anscnt)

Submission status: Wrong Answer

Solution code:
n = int(input())
lista = []
for q in range(n):
    numero = int(input())
    if numero in lista:
        lista.pop()
    else:
        lista.append(numero)
print(len(lista))

Submission status: Wrong Answer

Solution code:
n = int(input())
lista = []
contador = 0
while contador < n:
    numero = int(input())
    if numero in lista:
        lista.pop()
    else:
        lista.append(numero)
    contador += 1
print(len(lista))

Submission status: Wrong Answer

Solution code:
L = [int(input()) for _ in range(int(input()))]
r = 0
for s in set(L):
    if L.count(s) % 2 == 0:
        r+=1
print(r)

Submission status: Wrong Answer

Solution code:


import numpy as np

n=int(input())
a=np.array([int(input()) for i in range(n)])
a=np.sort(a)
ans=0
i=0
while(i<=n-1):
    c=1
    while(i<=n-2 and a[i]==a[i+1]):
        i+=1
        c+=1
    if(c%2==1):ans+=1
    print(a[i],c)
    i+=1
print(ans)

Submission status: Wrong Answer

Solution code:


import numpy as np

n=int(input())
a=np.array([int(input()) for i in range(n)])
a=np.sort(a)
ans=0
for i in range(n):
    c=0
    while(i<=n-2 and a[i]==a[i+1]):
        i+=1
        c+=1
    if(c%2==1):ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter

n = int(input())
a = []
for i in range(n):
    a.append(int(input()))

# count = [0] * (max(a)+1)

c = Counter(a)
ans = 0

for _a in a:
    if c[_a]%2 != 0:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [0]*n
for i in range(n):
    a[i] = int(input())
s = n
a.sort()
for i in range(n-1):
    if(a[i] == a[i+1]):
        s -= 2
print(s)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = sorted([int(input()) for _ in range(n)])
ans = 0
tmp = 1
for i in range(n-1):
    if a[i] == a[i+1]:
        tmp += 1
    else:
        if tmp % 2 == 1:
            ans += 1
        tmp = 1
print(ans)

Submission status: Wrong Answer

Solution code:
dic = {}
N = int(input())
for _ in range(N):
  A = int(input())
  if A not in dic:
    dic[A] = 1
  else:
    dic[A] -= 1
print(sum(dic.values()))

Submission status: Wrong Answer

Solution code:
from collections import Counter
def main():
    n=int(input())
    L=[0]*n
    for i in range(n):
        L[i] = int(input())
    print(sum(s*(s%2) for s in Counter(L).values()))
main()

Submission status: Wrong Answer

Solution code:
N = int(input())

A = []

for _ in range(N):
    A.append(int(input()))

A.sort()

count = 0
sum = 0
for i in range(N-1):
    if A[i+1]==A[i]:
        count = count + 1
        continue
    else:
        count = count + 1
        if count%2!=0:
            sum = sum + 1
        count = 0
        
print(sum)

Submission status: Wrong Answer

Solution code:
D = {}
N = int(input())
for i in range(N):
  A = int(input())
  if A in D:
    D[A] -= 1
  else:
    D[A] = 1
print(sum(D[i] for i in D))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
a.sort()

prv = a[0]
cnt = 1
ans = 0
for i in range(1, n):
    if a[i] == a[i-1]:
        cnt ^= 1
        if i == n-1:
            ans += cnt
    else:
        ans += cnt
        cnt = 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
a.sort()

prv = a[0]
cnt = 1
ans = 0
for i in range(1, n):
    if a[i] == a[i-1]:
        cnt ^= 1
        if i == n:
            ans += cnt
    else:
        ans += cnt
        cnt = 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
a.sort()

prv = 0
cnt = 0
ans = 0
for i in range(n):
    if a[i] == prv:
        cnt ^= 1
        if i == n:
            ans += cnt
    else:
        ans += cnt
        cnt = 1
    prv = a[i]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
for _ in range(n):
    a.append(int(input()))
a.sort()

prv = 0
cnt = 0
ans = 0
for i in range(n):
    if a[i] == prv:
        cnt ^= 1
    if a[i] != prv:
        ans += cnt
        cnt = 1
    prv = a[i]
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()

if len(a) == 1: cnt = 1
else: cnt = 0
while len(a) > 2:
    same_cnt = 1
    j = 1
    while a[0] == a[j]:
        same_cnt += 1
        if j == len(a) - 1:
            break
        j += 1
    if same_cnt  % 2 == 1:
        cnt += 1
    del a[0:same_cnt]
print(cnt)

Submission status: Wrong Answer

Solution code:
d={}
for _ in[0]*int(input()):
    i=input()
    d[i]=d.get(i,0)^1
    print("d[i]", d[i])
print(sum(d.values()))

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(N):
    a.append(int(input()))
    
a.sort()
flag=False
ans = 0
i = 0
while i <= len(a) - 2:
    if a[i] != a[i+1]:
        ans += 1
        i += 1
        flag=True
    else:
        i += 2
        flag=False

if flag:
    ans += 1
if a[-3] == a[-2]:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(N):
    a.append(int(input()))
    
a.sort()
flag=False
ans = 0
i = 0
while i <= len(a) - 2:
    if a[i] != a[i+1]:
        ans += 1
        i += 1
        flag=True
    else:
        i += 2
        flag=False

if flag:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(N):
    a.append(int(input()))
    
a.sort()
ans = 0
i = 0
while i <= len(a) - 2:
    if a[i] != a[i+1]:
        ans += 1
        i += 1
    else:
        i += 2
        
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A = sorted(A)
ans = 0
prev = A[0]
cnt = 0
for a in A:
    if prev == a:
        cnt += 1
        prev = a
    else:
        if cnt % 2 == 1:
            ans += 1
        cnt = 1
        prev = a
if cnt == 1:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A = sorted(A)
ans = 0
prev = A[0]
cnt = 0
for a in A:
    if prev == a:
        cnt += 1
        prev = a
    else:
        if cnt % 2 == 1:
            ans += 1
        cnt = 1
        prev = a

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
dic = {}
for _ in range(n):
  tmp = int(input())
  if tmp in dic and dic[tmp] == 1:
    dic[tmp]== 0
  else:
    dic[tmp] = 1
print(sum(dic.values()))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = set()
for _ in range(n):
    a ^= set(input())
print(len(a))

Submission status: Wrong Answer

Solution code:
N = int(input())

input_dict = {}
for _ in range(N):
    a = int(input())
    if a in input_dict:
        input_dict[a] -= 1
    else:
        input_dict[a] = 1

count = 0
for k in input_dict:
    if input_dict[k] == 1:
        count += 1
    
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
sa=set()
sb=set()
for i in range(n):
	a=int(input())
	if len(sa&{a})==0:
		sa.add(a)
	else:
		sb.add(a)
print(len(sa^sb))

Submission status: Wrong Answer

Solution code:
n=int(input())
sa=set()
sb=set()
for i in range(n):
	a=int(input())
	if len(sa&{a})==0:
		sa.add(a)
	else:
		sb.add(a)
print(sa)
print(sb)
print(len(sa^sb))

Submission status: Wrong Answer

Solution code:
n=int(input())
sa=set()
sb=set()
for i in range(n):
	a=input()
	if len(sa&{a})==0:
		sa.add(a)
	else:
		sb.add(a)
print(len(sa^sb))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
cnt = 1
ans = 0
A.sort()
for i in range(N-1):
    if A[i] == A[i+1]:
        cnt += 1
    else:
        if cnt%2 == 1:
            ans += 1
        cnt = 1
if cnt == 1:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
cnt = 1
ans = 0
A.sort()
for i in range(N-1):
    if A[i]==A[i+1]:
        cnt += 1
    else:
        if cnt%2 == 1:
            ans += 1
        cnt = 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
cnt = 0
ans = 0
A.sort()
for i in range(N-1):
    if A[i]==A[i+1]:
        cnt += 1
    else:
        if cnt%2 != 1:
            ans += 1
        cnt = 0
print(ans)

Submission status: Wrong Answer

Solution code:
A = set()
for i in range(int(input())):
	A ^= set(input())
print(len(A))

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input())for _ in range(N)]
A.sort()
ans=0
check=0

for i in range(N-1):
    if check==1:
        check=0
        continue
    
    if  A[i]-A[i+1]:
        ans+=1
    if not A[i]-A[i+1]:
        check=1
        continue
            
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input())for _ in range(N)]
A.sort()
ans=0
check=0

for i in range(N-2):
    if check==1:
        check=0
        continue
    
    if  A[i]-A[i+1]:
        ans+=1
    if not A[i]-A[i+1]:
        check=1
        continue
        
if A[N-1]-A[N-2]:
    ans+=2
if not A[N-1]-A[N-2]:
    ans+=0        
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input())for _ in range(N)]
A.sort()
print(A)
ans=0
check=0

for i in range(N-2):
    if check==1:
        check=0
        continue
    
    if  A[i]-A[i+1]:
        ans+=1
    if not A[i]-A[i+1]:
        check=1
        continue
        
if A[N-1]-A[N-2]:
    ans+=2
if not A[N-1]-A[N-2]:
    ans+=0        
print(ans)

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input())for _ in range(N)]
A.sort()
ans=0
for i in range(N-2):
    if A[i]-A[i+1]:
        ans+=1
    else:
        ans-=1
if not A[N-1]==A[N-2]:
    ans+=2
if  A[N-1]==A[N-2]:
    ans+=0        
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
Lst = [int(input()) for x in range(N)]

Lst_New = sorted(Lst)
cnt = 1
Ttl = 0
for x in range(len(Lst_New)):
  if x > 0:
    if Lst_New[x] == Lst_New[x-1]:
    	cnt += 1
    elif cnt % 2 != 0:
      	cnt = 1
      	Ttl += 1
    else:
      	cnt = 1
      
print(Ttl)

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left as bl
n = int(input())
L = [int(input())]

counter = 0
for i in range(n-1):
  num = int(input())
  index = bl(L, num)
  if index < i+1:
    if L[index] == num:
      counter += 2    
  L.insert(index, num)
print(len(L)-counter)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
ans = 0
for i in range(n):
    a.append(int(input()))
a.sort()
pre = a[0]
count = 0
for i in range(n):
    if pre != a[i]:
        if count % 2 == 1:
            ans += 1
        else:
            count = 1    
    else:
        count += 1
    pre = a[i]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
cnt = 1
ans = 0
if len(A) == 1:
    print(1)
    exit()
for i in range(1,N):
    if A[i-1] == A[i]:
        cnt += 1
    else:
        ans += cnt%2
        cnt = 1
if cnt > 1:
    ans += cnt%2
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
cnt = 1
ans = 0
for i in range(1,N):
    if A[i-1] == A[i]:
        cnt += 1
    else:
        ans += cnt%2
        cnt = 1
if cnt > 1:
    ans += cnt%2
print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin
from collections import Counter

n, *a = (int(x) for x in stdin.read().split())

count = 0
for v in Counter(a).values():
    if v % 2 == 0: count += 1

print(count)

Submission status: Wrong Answer

Solution code:
from sys import stdin

n, *a = (int(x) for x in stdin.read().split())

each_count = {n: 0 for n in set(a)}


for n in a:
    each_count[n] += 1

count = 0
for v in each_count.values():
    if v % 2 == 0: count += 1

print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
s=set()
for i in range(n):
    s=s^set(input())
print(len(s))

Submission status: Wrong Answer

Solution code:
s=set()
for i in range(int(input())):
    s=s^set(input())
print(len(s))

Submission status: Wrong Answer

Solution code:
n=int(input())
print(2*len({int(input()) for i in range(n)})-n)

Submission status: Wrong Answer

Solution code:
print(len({int(input()) for i in range(int(input()))}))

Submission status: Wrong Answer

Solution code:
import collections
n = int(input())
a = [int(input()) for _ in range(n)]
c = collections.Counter(a)

print(len(list(filter(lambda x: x[1] == 1, c.items()))))

Submission status: Wrong Answer

Solution code:
n = int(input())
list_ = [int(input()) for _ in range(n)]

dict_ = dict()
for key in list_:
    dict_[key] = dict_.get(key, 0) + 1
print(dict_)
print(sum(num % 2 for num in dict_.values()))

Submission status: Wrong Answer

Solution code:
n = int(input())
list_ = [int(input()) for _ in range(n)]

dict_ = dict()
for key in set(list_):
    dict_[key] = dict_.get(key, 0) + 1
print(sum(num % 2 for num in dict_.values()))

Submission status: Wrong Answer

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
A.sort()
O=[]
c=0
ans=0

for i in A:
    if i not in O:
        O.append(i)
        if c%2==1:
            ans+=1
        c=0
    else:
        c+=1
        
print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np
import sys
n = int(input())
a = set()
for _ in range(n):
    a ^= set(input())
print(len(a))

Submission status: Wrong Answer

Solution code:
import collections

N = int(input())

List = {}
for i in range(N):
    A = int(input())
    if List.get(A,None)==None:
        List[A]=1
    else:
        List[A]=0

c = collections.Counter(List)

print(len(c.most_common(1)))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[input() for i in range(n)]
a.sort()
cnt=0
for i in set(a):
  _cnt = a.count(i)
  if _cnt>=2:
    cnt+=_cnt/2
print(int(n-cnt*2))

Submission status: Wrong Answer

Solution code:
import collections

def test():
    n = int(input())
    a = [int(input()) for i in range(n)]
    b = collections.Counter(a)
    print(b)
    ans = 0
    for i in b.values():
        if i % 2 != 0:
            ans += 1
    print(ans)


if __name__ == "__main__":
    test()

Submission status: Wrong Answer

Solution code:
count = 0
N = int(input())
string = ""
for i in range(N):
    string += input()
string = list(string)
for i in range(10):
    if string.count(str(i)) % 2 != 0:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(n):
    a.append(int(input()))
a2=sorted(a)
num=a2[0]
count=1
ans=0
for i in range(1,n):
    if a2[i]==num:
        count+=1
    else:
        if count%2==1:
            ans+=num
        num=a2[i]
        count=1
if count%2==1:
        ans+=num
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [set(input()) for _ in range(n)]

s = set()
for a_ in a:
    s ^= a_

print(len(s))

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
a.append(1000000001)
a.append(0)
a.sort()
c=0
ans=0
s=0
#print(a)
for i in range(1,n+1):
    if a[i]==c:
        s+=1
    else:
        ans+=s%2
        c=a[i]
        s=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()
#print(a)
a.append(1000000001)
c=a[0]
ans=0
s=0
for i in range(1,n+1):
    if a[i]==c:
        s+=1
    else:
        ans+=s%2
        c=a[i]
        s=0
print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter
N = int(input())
A = []
cnt = 0
for i in range(N):
    a = str(input())
    A.append(a)
c = Counter(A)
set_A = list(set(A))
for i in set_A:
    if int(c[str(i)]) < 2:
        cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
from collections import Counter

def main():
  n = int(input())
  ans = []
  append = ans.append
  A = Counter((int(input()) for _ in range(n)))
  append((1 for i in A.values() if i%2!=0))
  print(len(ans))

if __name__=='__main__':
  main()

Submission status: Wrong Answer

Solution code:
from collections import Counter

def main():
  n = int(input())
  ans = 0
  A = Counter((int(input()) for _ in range(n)))
  for i in A.values():
    if i%2 != 0:
      ans += 1
  return ans

if __name__=='__main__':
  main()

Submission status: Wrong Answer

Solution code:
# ABC073A - September 9
def main():
    N = input().rstrip()
    flg = "9" in N
    print("Yes" if flg else "No")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
N = int(input())
A = [int(input()) for _ in range(N)]
A.sort()
base=0

sum=0
cnt=0
for i in range(N):
    if(A[i]==base):
        cnt+=1
    elif(A[i]!=base):
        base=A[i]
        if(cnt%2==1):
            sum+=1
        cnt=1
print(sum)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    l.append(int(input()))
l.sort()
l.append(10000000000000000000000)
f=1
ans=0
for i in range(n-1):
    if l[i]==l[i+1]:
        f+=1
    else:
        ans+=f%2
        f=1
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(n):
  a.append(int(input()))
from collections import Counter
b=list(Counter(a).values())
cnt=0
for i in range(len(b)):
  if b[i]%2==0:
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline
n=int(input())
a=[int(input()) for _ in range(n)]
a.sort()
h=a[0]
ans=1
for i in a[1:]:
    if i!=h:
        ans+=1
    else:
        ans-=1
    h=i    
print(ans)

Submission status: Wrong Answer

Solution code:
s = set()
for i in range(int(input())):s ^= set(input())
print(len(s))

Submission status: Wrong Answer

Solution code:
s=set()
for i in range(int(input())):s^=set(input())
print(len(s))

Submission status: Wrong Answer

Solution code:
S = set()
for i in range(int(input())):
    A = set(input())
    S ^= A
print(len(S))

Submission status: Wrong Answer

Solution code:
N=int(input())
x=[]
for i in range(N):
    if i==0:
        x+=list(map(int,input()))
    else:
        y=int(input())
        if y in x:
            x.remove(y)
        else:
            x.append(y)
print(len(x))

Submission status: Wrong Answer

Solution code:
from collections import Counter
import sys
input = sys.stdin.readline

N = int(input())
A = [input for i in range(N)]
a = list(Counter(A).values())
a = [i for i in a if i % 2 == 1]

print(len(a))

Submission status: Wrong Answer

Solution code:
n = int(input())
arr = []

for i in range(n):
    x = int(input())
    arr.append(x)


arr.sort()

tmp = arr[0]

cnt = 0

p = 1

for i in range(1, n):
    if tmp != arr[i]:
        tmp = arr[i]
        if p % 2 != 0:
            cnt += 1
        p = 1
    else:
        p += 1


print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
import collections

c = collections.Counter(A)
ans = 0
for a in A:
    if c[a]%2 == 1: ans += 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n = int(input())
a = []
for i in range(n):
    string = int(input())
    # if a.count(string) == 0:
    #     a.append(string)
    # else:
    # a.remove(string)
print(len(a))

Submission status: Wrong Answer

Solution code:
N = int(input())
As = [int(input()) for i in range(N)]

data = {}

for a in As:
  if a in data.keys():
    data[a] = 0
  else:
    data[a] = 1

ans = sum(list(data.values()))

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
    l.append(int(input()))
l.sort()

ans=[0]*n
c=0
for i in range(n-1):
    if l[i]==l[i+1]:
        ans[i]+=1
        ans[i+1]+=1
kai=0
for i in range(n):
    if ans[i]==0:
        kai+=1
print(kai)

Submission status: Wrong Answer

Solution code:
n = int(input())

set_a = []
minus = 0

for i in range(n):
    tmp = int(input())
    if tmp in set_a:
        minus += 1
    else:
        set_a.append(tmp)
        
print(len(set_a)-minus)

Submission status: Wrong Answer

Solution code:
import sys
import bisect
input = sys.stdin.readline

def main():
    N = int(input())

    a = sorted([int(input()) for i in range(N)])

    ans = 0
    pre = a[0]
    count = 1
    for i in range(1, N):
        if pre != a[i] and count&1:
            ans += 1
            count = 0
        count += 1
        pre = a[i]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
for i in range(n):
  a.append(int(input()))
c=1
a.sort()
for i in range(n-1):
  if a[i]!=a[i+1]:
    c=c+1
  else:
    c=c-1
print(c)

Submission status: Wrong Answer

Solution code:
a = set()
for i in range(int(input())):
    a ^= set(input())
print(len(a))

Submission status: Wrong Answer

Solution code:
N = int(input())
S = set()
for i in range(N):
    S^=set(input())
print(len(S))

Submission status: Wrong Answer

Solution code:
N = int(input())

s = set()

for _ in range(N):

    A = int(input())

    if not A in s:
        s = s - set({A})
    else:
        s.add(A)

print(len(s))

Submission status: Wrong Answer

Solution code:
n = int(input())
s = set()
for i in range(n):
  s = s ^ set(input()) 
print(len(s))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]

result = {}
for a_i in a:
    if not a_i in result:
        result[a_i] = 1
    else:
        result[a_i] = 0
print(list(result.values()).count(1))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]
array = {}

for i in range(n):
    if a[i] not in array:
        array[a[i]] = 1
    else:
        array[a[i]] = 0

print(sum(array.values()))

Submission status: Wrong Answer

Solution code:
n = int(input())
array = {}

for i in range(n):
    a = int(input())
    if a in array:
        array[a] = 0
    else:
        array[a] = 1

print(sum(array.values()))

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]

a.sort()

ans = 0
tmp = 1

for i in range(n-1):
    if a[i] == a[i+1]:
        tmp += 1
        if i == n-2:
            ans += tmp % 2
            tmp = 1
    else:
        ans += tmp % 2
        tmp = 1

if tmp%2 == 1:
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]

a.sort()

ans = 0
tmp = 1

for i in range(n-1):
    if a[i] == a[i+1]:
        tmp += 1
        if i == n-2:
            ans += tmp % 2
            tmp = 1
    else:
        ans += tmp % 2
        tmp = 1

print(ans)