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 = [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-1:
            ans += tmp % 2
    else:
        ans += tmp % 2
        tmp = 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
    else:
        ans += tmp % 2
        tmp = 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
    else:
        ans += tmp % 2
        tmp = 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(a) - (len(a) - len(set(a))) * 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(len(set(a)) * 2 - len(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
As=[int(input()) for _ in range(n)]
As.sort()
As_uniq=list(set(As))

ans=0
c=1
for i in range(1,n):
  if As[i]==As[i-1]:
    c+=1
  else:
    if c%2==1:
      ans+=1
    c=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
c = []
for i in A:
    if i in c:
        c.remove(i)
        continue
    c.append(i)
print(len(A))

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
c = []
for i in A:
    if i in A:
        A.remove(i)
        continue
    A.append(i)
print(len(A))

Submission status: Wrong Answer

Solution code:
n = int(input())

d = {}

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

ans = 0
for v in d.values():
  ans += v
  
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
li = [int(input()) for _ in range(n)]
li.sort()
tmp = 0
new_li = []
for l in li:
    if l != tmp:
        tmp = l
        new_li.append(1)
    elif l == tmp:
        new_li[-1] += 1
sum = 0
for n in new_li:
    if n%2 != 0:
        sum += n
print(sum)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
for i in range(n):
  a.append(int(input()))
a.sort()
ans = 0
for i in range(n):
  try:
    if a[i-1] != a[i]:
      ans += cnt
      cnt = 1
    else:
      cnt = 1 - cnt
  except:
    #i==0
    cnt = 1
print(ans)

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:
def main():
    N = int(input())
    A = [0]*N
    for i in range(N):
        A[i] = int(input())

    A = sorted(A)
    answer = 0
    prev = None
    cnt = 0
    for a in A:
        if prev == a:
            cnt += 1
        else:
            cnt = 0
            prev =  a
        if cnt % 2 == 1:
            answer += 1
    if cnt % 2 == 1:
      answer+=1
    print(answer)
main()

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    A = [0]*N
    for i in range(N):
        A[i] = int(input())

    A = sorted(A)
    answer = 0
    prev = None
    cnt = 0
    for a in A:
        if prev == a:
            cnt += 1
        else:
            cnt = 0
            prev =  a
        if cnt % 2 == 1:
            answer += 1
    print(answer)
main()

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
A = [int(input()) for _ in range(N)]
c = collections.Counter(A)
ans = 0
for i in c.values():
    if i & 2 != 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
A = [int(input()) for _ in range(N)]
c = collections.Counter(A)
ans = 0
for i in range(len(c)+1):
    if c.get(A[i]) % 2 != 0:
        ans += 1
print(ans)

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res = 0
cnt = 0
for i in range(N):
    if i == 0:
        cnt = 1
        if N == 1:
            res = 1
    else:
        if A[i-1]==A[i]:
            cnt += 1
            if i == N-1:
                res += cnt%2
        else:
            res += cnt%2
            cnt = 1
print(res)

Submission status: Wrong Answer

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

res = 0
cnt = 0
for i in range(N):
    if i == 0:
        cnt = 1
    else:
        if A[i-1]==A[i]:
            cnt += 1
            if i == N-1:
                res += cnt%2
        else:
            res += cnt%2
            cnt = 1
print(res)

Submission status: Wrong Answer

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

res = 0
cnt = 0
for i in range(N):
    if i == 0:
        cnt = 1
    else:
        if A[i-1]==A[i]:
            cnt += 1
        else:
            res += cnt%2
            cnt = 1
print(res)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
#ABC070C
import math

n = int(input())

t=[]
for i in range(0,n):
	t.append(0)
for i in range(0,n):
    t[i] = int(input())
t.sort()

sum=0
tmp=t[0]
tmpnum=1
for i in range(1,n):
	if(t[i]==tmp):
		tmpnum+=1
		if(i==n-1):
			sum+=tmpnum%2
	else:
		tmp=t[i]
		sum+=tmpnum%2
		tmpnum=1
print(sum)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
#ABC070C
import math

n = int(input())

t=[]
for i in range(0,n):
	t.append(0)
for i in range(0,n):
    t[i] = int(input())
t.sort()

sum=0
tmp=t[0]
tmpnum=1
for i in range(1,n):
	if(t[i]==tmp):
		tmpnum+=1
	else:
		tmp=t[i]
		sum+=tmpnum%2
		tmpnum=1
print(sum)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))

A.sort()
count = 1
for i in range(1,N):
    if A[i] == A[i-1]:
        count -=1
    else:
        count+=1
print(count)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys

sys.setrecursionlimit(10**7)


def read_h(typ=int):
    return list(map(typ, input().split()))


def read_v(n, m=1, typ=int):
    return [read_h() if m > 1 else typ(input()) for _ in range(n)]


def main():
    N, = read_h()
    A = read_v(N)

    cnts = {}
    for a in A:
        cnts[a] = cnts.get(a, 0) + 1

    print(cnts)

    ans = 0
    for n in cnts.values():
        if n % 2 != 0:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N =  int(input())
A = [int(input()) for i in range(N)]
A.sort()
ans = 0
tmp = A[0]
count = 1
for i in range(1,N):
    if tmp!=A[i]:
        if count%2==0:
            ans += 1
        count = 0
        tmp = A[i]
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

tmpNum = alist[0]
cnt = 1
ans = 0
for i in range(1, N):
	if tmpNum == alist[i]:
		cnt = cnt + 1
	else:
		if cnt % 2 != 0:
			ans = ans + 1
			if i == N-1:
				ans = ans + 1
		tmpNum = alist[i]
		cnt = 1

if N == 1:
	ans = ans + 1

print(ans)

Submission status: Wrong Answer

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

tmpNum = 0
cnt = 0
ans = 0
for i in range(N):
	if i == 0:
		tmpNum = alist[i]
		cnt = 1
	else:
		if tmpNum == alist[i]:
			cnt = cnt + 1
		else:
			if cnt % 2 != 0:
				ans = ans + 1
			tmpNum = alist[i]
			cnt = 1

print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter
n=int(input())
A=Counter(input())
for i in range(n-1):
    A += Counter(input())
ans=0
for e in A:
    if A[e]%2==1:
        ans+=1
print(ans)

Submission status: Wrong Answer

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

se = set(a)
ans = 0
for i in se:
    ans += a.count(i)//2
print(ans)

Submission status: Wrong Answer

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

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

ans=0
for i in dict.values():
    ans+=i
print(ans)

Submission status: Wrong Answer

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

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

ans=0
for i in dict.keys():
    if dict[i]==1:
        ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
data=[int(input()) for i in range(int(input()))]
data.sort()
count=0
value=1
predata=None
for i in range(0,len(data)):
    if predata==data[i]:
        value+=1
    else:
        predata=data[i]
        count+=value%2
        value=1
print(count)

Submission status: Wrong Answer

Solution code:
data=[int(input()) for i in range(int(input()))]
data.sort()
count=0
value=1
predata=data[0]
for i in range(1,len(data)):
    if predata==data[i]:
        value+=1
    else:
        predata=data[i]
        count+=value%2
        value=1
print(count)

Submission status: Wrong Answer

Solution code:
data=[int(input()) for i in range(int(input()))]
data.sort()
count=0
value=1
for i in range(1,len(data)):
    if data[i]==data[i-1]:
        value+=1
    if data[i]!=data[i-1]:
        count+=value%2
        value=1
print(count)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = []
d={}
for i in range(n):
    x = int(input())
    a.append(x)
for i in range(len(a)):
    try:
        d[a[i]]-=1
    except:
        d[a[i]]=1
l = 0

for key in d:
    l+=d[key]
print(l)

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
for _ in range(N):
    l.append(int(input()))

import collections
cnt = 0
c = collections.Counter(l)
c = c.most_common()
for idx, num in enumerate(c):
    if num[1] == 1:
        d = c[idx:]
        for i in d:
            cnt += i[1]
        break

print(cnt)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[]
b=[]
c=0
i=1
while(i<=n):
    c=int(input())
    if(c in a):
        b.append(c)
    else:
        a.append(c)
    i+=1
print(len(a)-len(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    A = [int(input()) for _ in range(N)]
    A.sort()
    i = 1
    C = [0] * (N + 1)
    C[0] = 1
    for i in range(1, N):
        if A[i - 1] == A[i]:
            C[i] = -1
        else:
            C[i] = 1
    print(sum(C))


main()

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = [input() for i in range(n)]

ans.sort()

s = sorted(set(ans))
t = 0
cnt = 0

result = 0
for i in range(n):
    temp = s[t]
    if ans[i] == temp:
        cnt += 1
    else:
        if cnt % 2 == 1:
            result += 1
        cnt = 1
        t += 1
        
    
    

print(result)

Submission status: Wrong Answer

Solution code:
n = int(input())

ans = []

for i in range(n):
    s = input()
    ans = set(ans) ^ set(s)
    
print(len(ans))

Submission status: Wrong Answer

Solution code:
N=int(input())
L=[0]*N
for i in range(N):
    L[i]=int(input())
L.sort()
ans=0
count=True
past=L[0]
for i in range(1,N):
    if L[i]==past:
        if count:
            count=False
        else:
            count=True
    else:
        past=L[i]
        if count:
            ans+=1
        else:
            count=True

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
lst = [0]
for i in range(N):
	lst += [int(input())]

lst.sort()

ans = 0
count = 0
for i in range(1,N+1):
	if lst[i] != lst[i-1]:
		ans += count%2
		count = 1
	else:
		count += 1
		
print (ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
paper = {}
for _ in range(n):
    x = int(input())
    if x in paper:
        paper[x] += 1
    else:
        paper[x] = 1
count = 0
for i in paper.values():
    if i % 2 == 0: count += 1
print(count)

Submission status: Wrong Answer

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n=I()

  l=[I() for _ in range(n)]

  l.sort()

  l2=[]
  for x in l:
    if len(l2)>0:
      if x==l[-1]:
        l2.pop()
      else:
        l2.append(x)
    else:
      l2.append(x)

  return len(l2)

print(main())

Submission status: Wrong Answer

Solution code:
N = int(input())

a_dict = {}
for i in range(N):
  t = int(input())
  if t in a_dict:
    a_dict[t] = 0
  else:
    a_dict[t] = 1
print(len([0 for i in a_dict.values() if i]))

Submission status: Wrong Answer

Solution code:
N = int(input())

A = []

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

A.sort()

answer = 0

#Must initialize to 1
sameNumCounter = 1
prev = 0

arrayNum = 0

isEnd = False
while(True):
    nowNumber = A[arrayNum]
    checkArray = arrayNum
    while(True):
        #print(checkArray,arrayNum)
        checkArray+=1
        if checkArray >= len(A):
            isEnd = True
            break
        checkNum = A[checkArray]
        if nowNumber != checkNum:
            break
        
    if isEnd:
        break

    if (checkArray - arrayNum)%2 == 1:
        answer += 1

    
    
    arrayNum = checkArray

print(answer)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

a = sorted(a)


temp = a[0]
c = 0
ans = 0

cnts = [0]*n

for i in a:
    if temp == i:
        cnts[c] += 1
    
    else:
        temp = i
        if cnts[c] % 2 == 1:
            ans += 1
        c += 1
        cnts[c] += 1

print(ans)

Submission status: Wrong Answer

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

from collections import Counter
A=Counter(A)
print(sum([A[a] for a in A.keys() if A[a]%2==1]))

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

A_cnt = list(Counter(A).values())
ans = A_cnt.count(1)

print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter
n = int(input())
a = Counter(list(int(input()) for i in range(n)))
print(sum(x % 2 == 0 for x in a.values()))

Submission status: Wrong Answer

Solution code:
from collections import Counter

A = [int(input()) for _ in range(int(input()))]
C = Counter(A)

ans = 0
for c in C.values():
    ans += 1 if c%2 == 0 else 0
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
  m=int(input())
  l.append(m)
c=0
d=1
e=l[0]
l=sorted(l)
for i in range(1,n):
  if l[i]!=e:
    if d%2==1:
      c+=1
    e=l[i]
    d=1
  else:
    d+=1
if d%2==1:
  c+=1
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
  m=int(input())
  l.append(m)
c=0
d=1
e=l[0]
l=sorted(l)
for i in range(1,n):
  if l[i]!=e:
    if d%2==1:
      c+=1
    e=l[i]
    d=1
  else:
    d+=1
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
  m=int(input())
  l.append(m)
c=0
d=0
e=l[0]
l=sorted(l)
for i in range(1,n):
  if l[i]!=e:
    if d%2==1:
      c+=1
    e=l[i]
    d=1
  else:
    d+=1
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(n):
  m=int(input())
  l.append(m)
c=0
d=0
e=0
l=sorted(l)
for i in range(n):
  if l[i]!=e:
    if d%2==1:
      c+=1
    e=l[i]
    d=1
  else:
    d+=1
print(c)

Submission status: Wrong Answer

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
a.sort()    
ans=0
for i in range(n):
    if a[i]!=a[i-1]:
        if a.count(a[i])%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())
a.sort()    
ans=0
for i in range(n):
    if a[i]!=a[i-1] and a.count(a[i])%2!=0:
        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()
ctr=1
ans=0
for i in range(n-1):
    if a[i]==a[i+1]:
        ctr+=1
    else:
        if ctr%2!=0:
            ans+=1
        ctr=1
if a[n-2]!=a[n-1]:
    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()
ctr=0
ans=0
for i in range(n-1):
    if a[i]==a[i+1]:
        ctr+=1
    else:
        if ctr%2==0:
            ans+=1
        ctr=0
if a[n-2]!=a[n-1]:
    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()
ctr=1
ans=0
for i in range(n-1):
    if a[i]==a[i+1]:
        ctr+=1
    else:
        if ctr%2!=0:
            ans+=1
        ctr=1
print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter

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

A.sort()

result, count = 0, 0
prev = A[0]
for a in A:
    if a != prev:
        result += (count % 2)
        count = 0
    count += 1
    prev = a

print(result)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []
for i in range(N):
    if i in a:
        a.remove(i)
    else:
        a.append(int(input()))
print(len(a))

Submission status: Wrong Answer

Solution code:
N=int(input())
ans=[]
for i in range(N):
    A=int(input())
    ans.append(A)
print(2*len(list(set(ans)))-len(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import exit, stdin
from collections import Counter
N = int(stdin.readline().rstrip())
A = Counter(int(stdin.readline().rstrip()) for _ in range(N))
print(len(Counter(a for a in A.elements() if A[a] == 1)))

Submission status: Wrong Answer

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

if N == 1:
    print(1)
    exit()

a.sort()
ans = 0
tmp = a[0]
a = a[1:]
count = 1
for aa in a:
    if aa == tmp:
        count += 1
    else:
        if count % 2 == 1:
            ans += 1
        tmp = aa
        count = 1
print(ans)

Submission status: Wrong Answer

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

a.sort()
ans = 0
tmp = a[0]
a = a[1:]
count = 1
for aa in a:
    if aa == tmp:
        count += 1
    else:
        if count % 2 == 1:
            ans += 1
        tmp = aa
        count = 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
A = {}
for _ in range(N):
  a = int(input())
  if a in A:
    A[a] += 1
    A[a] %= 2
  else:
    A[a] = 0
ans=0
for key in A.keys():
  ans += A[key]
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = {}
for _ in range(N):
  a = int(input())
  if a in A:
    A[a] += 1
    A[a] %= 2
  else:
    A[a] = 0
ans=0
for key in A.keys():
  ans += A[key]
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
ans=0
l=[int(input()) for i in range(n)]
from collections import Counter
lst=list(Counter(l).values())
def mod4(n):
  if n%4<2:
    return 1
  else:
    return 0
  ans=0
for i in lst:
  ans+=mod4(i)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = list(int(input()) for _ in range(N))
A.sort()
print(A)
count = 0
test = -1
stack = 0
for i in range(N):
    if test != A[i]:
        count += 1
        stack = 1
        test = A[i]
    else:
        if stack == 1:
            count = count - 1
            stack = 0
        else:
            stack = 1
            count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
a = set()

for i in range(N):
  ai = int(input())
  a.add(ai)
print(len(list(a)))

Submission status: Wrong Answer

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

for i in range(N):
  if i == 0:
    count = 1
    if N == 1:
      ans = 1
    
  elif A[i] == A[i-1]:
    count += 1
    
  elif A[i] != A[i-1] or i == N-1:
    if count % 2 == 1:
      ans += 1
    count = 1

    
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = [int(input()) for _ in range(n)]
n_dict = dict()
num = 0
for i in s:
    if i in n_dict:
        n_dict[i] = 0
    else:
        n_dict[i] = 1

for i, x in n_dict.items():
    num += x
print(num)

Submission status: Wrong Answer

Solution code:
N=int(input())
from collections import defaultdict
d=defaultdict(int)
for i in range(N):
    d[int(input())]+=1
cnt=1
for a in d.keys():
    if d[a]%2==1:
        cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
n=int(input())
l=[]
for i in range(0,n):
  x=int(input())
  l.append(x)
r=set(l)
print(2*len(r)-n)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = []
dict = {}
for i in range(n):
    a = input()
    if a in dict:
        dict[a] = 0
    else:
        dict[a] = 1

ans = 0
for v in dict.values():
    ans += v
#print(dict)
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
S = sorted(A)
cnt = 0
tmpcnt = 1

for i in range(N-1):
    if S[i] == S[i+1]:
        tmpcnt += 1
    else:
        if tmpcnt % 2 == 1:
            cnt += 1
        tmpcnt = 1
if S[N-2] != S[N-1]:
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
S = sorted(A)
cnt = 0
tmpcnt = 1

for i in range(len(S)-1):
    if S[i] == S[i+1]:
        tmpcnt += 1
    else:
        if tmpcnt % 2 == 1:
            cnt += 1
        tmpcnt = 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import collections
N = int(input())
a = [int(input()) for i in range(N)]
c = collections.Counter(a)
tmp = c.values()
count=0
for i in range(len(tmp)):
  if i%2!=0:
    count+=1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
A = set()
for i in range(n):
    k = int(input())
    A.add(k)
print(2*len(A)-n)

Submission status: Wrong Answer

Solution code:
n = int(input())
A = set()
for i in range(n):
    k = int(input())
    A.add(k) 
print(n - len(A))

Submission status: Wrong Answer

Solution code:
import collections
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
l = [I() for i in range(N)]
l.sort()


if N == 1:
    print(1)
else:
    tmp = 0
    cnt = 0
    ans = 0
    for i in range(N):
        if tmp == l[i]:
            cnt += 1
            if i == N-1:
                if cnt%2 != 0:
                    ans += 1
        else:
            if cnt%2 != 0:
                ans += 1
            tmp = l[i]
            cnt = 1

    print(ans)

Submission status: Wrong Answer

Solution code:
import collections
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
l = [I() for i in range(N)]
l.sort()

tmp = 0
cnt = 1
ans = 0
for i in range(N):
    if tmp == l[i]:
        cnt += 1
        if i == N-1:
            if cnt%2 != 0:
                ans += 1
    else:
        if cnt%2 != 0:
            ans += 1
        tmp = l[i]
        cnt = 1

print(ans)

Submission status: Wrong Answer

Solution code:
import collections
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
l = [I() for i in range(N)]
l.sort()

tmp = 0
cnt = 0
ans = 0
for i in range(N):
    if tmp == l[i]:
        cnt += 1
        if i == N-1:
            if cnt%2 != 0:
                ans += 1
    else:
        if cnt%2 != 0:
            ans += 1
        tmp = l[i]
        cnt = 1

print(ans)

Submission status: Wrong Answer

Solution code:
import collections
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
l = [I() for i in range(N)]
l.sort()

tmp = 0
cnt = 0
ans = 0
for i in range(N):
    if tmp == l[i]:
        cnt += 1
    else:
        if cnt%2 != 0:
            ans += 1
        tmp = l[i]
        cnt = 1

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
Alist = [int(input()) for i in range(N)]
Alist.sort()
Alist.append('END')
counter = 1
ans = 0

for i in range(1, N):
    if Alist[i - 1] == Alist[i]:
        counter += 1
    else:
        if counter % 2 == 1:
            ans += 1
        counter = 1

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())
Alist = [int(input()) for i in range(N)]
Alist.sort()

counter = 1
ans = 0

for i in range(1, N):
    if Alist[i - 1] == Alist[i]:
        counter += 1
    else:
        if counter % 2 == 1:
            ans += 1
        counter = 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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