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: Time Limit Exceeded

Solution code:
n = int(input())

num = []
cnt = 0

for i in range(n):
    a = int(input())
    if a in num:
        num.pop(num.index(a))
        cnt -= 1
    else:
        num.append(a)
        cnt += 1

print(cnt)

Submission status: Time Limit Exceeded

Solution code:
n, *a = map(int, open(0).read().split())
b = set()
for i in a:
    b = b ^ {i}
print(len(b))

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
n, *a = map(int, open(0).read().split())
b = set()
for i in a:
    b = b ^ {i}
print(len(b))

Submission status: Time Limit Exceeded

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

print(len(a))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = list(int(input()) for i in range(n))
b = list(set(a))
p = 0

for i in range(len(b)):
    if a.count(b[i]) % 2 != 0:
        p += 1

print(p)

Submission status: Time Limit Exceeded

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

for i in range(N):
  tmp = int(input())
  if tmp in arr:
    arr.remove(tmp)
    tmp = 0
  else:
    arr.append(tmp)
    tmp = 0
print(len(arr))

Submission status: Time Limit Exceeded

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

for i in range(N):
  tmp = int(input())
  if tmp in arr:
    arr.remove(tmp)
  else:
    arr.append(tmp)
print(len(arr))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())

p = []
for _ in range(n):
    a = input()
    if a in p:
        p.remove(a)
    else:
        p.append(a)
else:
    print(len(p))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

l = []
count = 0
for i in range(n):
    if a[i] in l:
        l.remove(a[i])
        count -= 1
    else:
        l.append(a[i])
        count += 1
print(count)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
d = {}
l = []

for i in range(n):
    a = int(input())
    if a not in l:
        l.append(a)
        d.update({a:1})
    else:
        if d[a] == 0:
            d[a] = 1
        else:
            d[a] = 0

ans = len(l)
for i in range(len(l)):
    if d[l[i]] == 0:
        ans -= 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from collections import Counter
n = int(input())
A = []
l = []

for i in range(n):
    a = int(input())
    A.append(a)
    if a not in l:
        l.append(a)

d = Counter(A)
ans = len(l)
for i in range(len(l)):
    if d[l[i]]%2 == 0:
        ans -= 1
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[int(input()) for i in range(n)]
b=set(a)
ans=0
for i in b:
  if a.count(i)%2==1:
    ans+=1
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[[0,0]]
ans=0
for _ in range(N):
    a=int(input())
    k=0
    for X in A:
        if X[0]==a:
            X[1]+=1
            k=1
            if X[1]%2==0:
                ans-=1
            else:
                ans+=1
            break
    if k==0:
        A.append([a,1])
        ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[[0,0]]
for _ in range(N):
    a=int(input())
    k=0
    for X in A:
        if X[0]==a:
            X[1]+=1
            k=1
            break
    if k==0:
        A.append([a,1])
ans=0
for X in A:
    x=X[0]
    y=X[1]
    if y%2==0:
        continue
    else:
        ans+=1

print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import math
import collections
import fractions
import itertools
import functools
import  operator

def solve():
    n = int(input())
    p = []
    for _ in range(n):
        num = int(input())
        if num in p:
            del p[p.index(num)]
        else:
            p.append(num)
    print(len(p))
    return 0

if __name__ == "__main__":
    solve()

Submission status: Time Limit Exceeded

Solution code:
# from pprint import pprint
# import math
# import collections

n = int(input())
# n, k = map(int, input().split(' '))
# a = list(map(int, input().split(' ')))
a = []
for i in range(n):
    a.append(int(input()))

l = []
for _a in a:
    if _a in l:
        l.remove(_a)
    else:
        l.append(_a)

print(len(l))

Submission status: Time Limit Exceeded

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

b = set(sorted(a))
count = 0

for i in b:
    if a.count(i) % 2 == 0:
        pass
    else:
        count += 1

print(count)

Submission status: Time Limit Exceeded

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

ans = []

for i in a:
    if ans.count(i) == 0:
        ans.append(i)

    else:
        ans.remove(i)

print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
num=[]
def ap(num1):
    num.append(num1)
def rm(num2):
    num.remove(num2)
for i in range(n):
    a=int(input())
    str=a in num
    if str==True:
        rm(a)
    else:
        ap(a)
print(len(num))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
S={input()}
for i in range(N-1):
    S=S^{input()}
print(len(S))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = [input() for _ in range(n)]
AS = set(A)
ASd = set(A)
for i in ASd:
    if A.count(i) % 2 == 0:
        AS.remove(i)
print(len(AS))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
a=[]
lis=[]
for i in range(n):
  inp=int(input())
  if not inp in a:
    a.append(inp)
    lis.append(1)
  else:
    lis[a.index(inp)]+=1
ans=0
for i in lis:
  if i%2:
    ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = [int(input()) for _ in range(n)]
As = set(A)
ans = 0
for i in As:
    if A.count(i) % 2 == 0:
        continue
    else:
        ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = []
for _ in range(n):
    a = input()
    if a not in A:
        A.append(a)
    else:
        A.remove(a)
print(len(A))

Submission status: Time Limit Exceeded

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

cnt=0
for i in set(a_list):
  cnt += a_list.count(i)%2
print(cnt)

Submission status: Time Limit Exceeded

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

cnt=0
for i in set(a_list):
  if a_list.count(i)%2==1:
    cnt+=1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

n = int(input())
map_ = {}
memo = []

for i in range(n):
  a = int(input())
  if a not in memo:
    map_.update({str(a):1})
    memo.append(a)
  else:
    map_[str(a)] += 1
list_ = np.array([i%2 for i in list(map_.values())])

print(np.sum(list_))

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

n = int(input())
map_ = {}
memo = []

for i in range(n):
  a = int(input())
  if a not in memo:
    map_.update({str(a):1})
    memo.append(a)
  else:
    map_[str(a)] += 1
    map_[str(a)] %= 2
print(np.sum(np.array(list(map_.values()))))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
map_ = {}
memo = []

for i in range(n):
  a = int(input())
  if a not in memo:
    map_.update({str(a):1})
    memo.append(a)
  else:
    map_[str(a)] += 1
    map_[str(a)] %= 2
print(sum(map_.values()))

Submission status: Time Limit Exceeded

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

for i in range(n):
  a = int(input())
  
  if str(a) not in list(map_.keys()):
    map_.update({str(a):1})
  else:
    map_[str(a)] += 1
    map_[str(a)] %= 2
print(sum(map_.values()))

Submission status: Time Limit Exceeded

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

print(len([i for i in A if A.count(i)%2 != 0]))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
x = []
count = 0

for i in range(N):
    a = int(input())
    if a in x:
        x.remove(a)
    else:
        x.append(a)

print(len(x))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = []
for i in range(n):
  a = int(input())
  if a not in l:
    l.append(a)
  elif a in l:
    l.remove(a)
print(len(l))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N,*A = map(int,open(0).read().split())
write = []
for i in A:
    if i not in write:
        write.append(i)
    else:
        write.remove(i)
print(len(write))

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N = int(input())
    A = []
    ans = 0
    for _ in range(N):
        a = int(input())
        if a in A:
            A.remove(a)
            ans -= 1
        else:
            A.append(a)
            ans += 1
    print(ans)
resolve()

Submission status: Time Limit Exceeded

Solution code:
def resolve():
    N = int(input())
    a = []
    ans = 0
    for _ in range(N):
        A = int(input())
        a.append(A)
    Aa = list(set(a))
    for i in range(len(Aa)):
        if a.count(Aa[i])%2 == 1:
            ans += 1
    print(ans)
resolve()

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
#-*-coding:utf-8-*-

def main():
    n = int(input())
    numbers=[]
    answers=[]
    number=0
    numbers=[int(input()) for _ in range(n)]

    for number in numbers:
        if len(answers)==0:
            answers.append(number)
        else:
            if number in answers:
                answers.remove(number)
            else:
                answers.append(number)
    print(len(answers))

if __name__=="__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]
a_set = set(a)
result = 0
def ct(i, a, result):
    cnt = a.count(i)
    if cnt % 2 == 1:
        result += 1
    return result

for i in a_set:
    result = ct(i, a, result)

print(result)

Submission status: Time Limit Exceeded

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

paper = set(a)
for j in paper:
    count = a.count(j)
    if count % 2 == 1:
        result += 1

print(result)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = []
for i in range(n):
    num = int(input())
    try:
        a.remove(num)
    except:
        a.append(num)
print(len(a))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
keep = []
ans = 0
for i in range(n):
    j = int(input())
    if j in keep:
        keep.remove(j)
        ans -= 1
    else:
        keep.append(j)
        ans += 1
print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
apple = []
for _ in range(n):
    a = str(input())
    if a not in apple:
        apple.append(a)
    else:
        apple.remove(a)
print(len(apple))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
apple = []
for _ in range(n):
    a = int(input())
    if a not in apple:
        apple.append(a)
    else:
        apple.remove(a)
print(len(apple))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
apple = []
for _ in range(n):
    apple.append(str(input()))
a = set(apple)
count = 0
for i in a:
    b = apple.count(i)
    if b%2 != 0:
        count += 1
    else:
        pass
print(count)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
apple = []
for _ in range(n):
    apple.append(str(input()))
orange = []

if len(set(apple)) == len(apple):
    orange = []
else:    
    for i in apple:
        if i not in orange:
            orange.append(i)
        else:
            orange.remove(i)
print(len(orange))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
apple = []
for _ in range(n):
    apple.append(str(input()))
orange = []
for i in apple:
    if i not in orange:
        orange.append(i)
    else:
        orange.remove(i)
print(len(orange))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
print(len([i for i in list(set(A)) if A.count(i)%2==1]))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
A_set = list(set(A))
result = []
for i in range(len(A_set)):
  if A.count(A_set[i])%2!=0:
    result.append(A_set[i])
print(len(set(result)))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
A_set = list(set(A))
result = []
for i in range(len(A_set)):
  if A.count(A_set[i])%2!=0:
    if i in result:
      continue
    result.append(A_set[i])
print(len(result))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
A_set = list(set(A))
result = []
for i in range(len(A_set)):
  if A.count(A_set[i])%2!=0:
    if i in result:
      A.remove(A_set[i])
      continue
    result.append(A_set[i])
  else:
    continue
print(len(result))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
result = []
for i in range(len(A)):
  if A.count(A[i])%2!=0:
    if i in result:
      A.remove(A[i])
      continue
    result.append(A[i])
  else:
    continue
print(len(result))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
A=[int(input()) for i in range(N)]
print(len([i for i in A if A.count(i)%2!=0]))

Submission status: Time Limit Exceeded

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

tmp = set(l)
tmp = list(tmp)
ans = []

for i in range(len(tmp)):
    b = l.count(tmp[i])
    if b%2 != 0:
        ans.append(tmp[i])


print(len(ans))

Submission status: Time Limit Exceeded

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

x = set()
for i in l:
    if i in x:
        continue
    else:
        x.add(i)
        if l.count(i)%2 ==1:
            #print(i, l.count(i))
            cnt+=1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [input() for _ in range(N)]
ans = 0
ans_list = list()
for i in A:
  if i in ans_list:
    ans -= 1
    ans_list.remove(i)
  else:
    ans_list.append(i)
    ans += 1
    
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
l = [0]*n

for i in range(n):
    a = int(input())
    if a not in l:
        l[i] = a
    else:
        l.remove(a)

l = [j for j in l if j != 0]

print(len(l))

Submission status: Time Limit Exceeded

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

for _ in range(n):
    a = int(input())
    if a not in l:
        l.append(a)
    else:
        l.remove(a)


print(len(l))

Submission status: Time Limit Exceeded

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

memo = []

for i in range(n):
    if l[i] not in memo:
        memo.append(l[i])
    else:
        memo.remove(l[i])

print(len(memo))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = [int(input()) for _ in range(n)]
a = []
for i in range(n) :
    if A[i] in a :
        a.remove(A[i])
    else :
        a.append(A[i])

print(len(a))

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
l=[]
for i in range(n):
    s=int(input())
    if s in l:
        l.pop(l.index(s))
    else:
        l.append(s)
print(len(l))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
ans = 0
n = int(input())
l = [input() for _ in range(n)]
s = set(l)
for i in s:
  if l.count(i)%2 != 0:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
ans = 0
n = int(input())
l = [int(input()) for _ in range(n)]
s = set(l)
for i in s:
  if l.count(i)%2 != 0:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(input()) for _ in range(N)]
B = list(set(A))
ans = 0
for i in B:
    if A.count(i) % 2 == 1:
        ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
A = [0]*n
for i in range(n):
    A[i] = int(input())
paper = []
for a in A:
    if a in paper:
        paper.remove(a)
    else:
        paper.append(a)
print(len(paper))

Submission status: Time Limit Exceeded

Solution code:
#ABC073-C
n = int(input())
paper = []
for _ in range(n):
    a = int(input())
    if a in set(paper):
        paper.remove(a)
    else:
        paper.append(a)

print(len(paper))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SISterN=[]
for n in range(N):
    _=int(input())
    if _<50000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 50001<_<80000:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    elif 80001<_:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SISterN))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SISterN=[]
for n in range(N):
    _=int(input())
    if _<30000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 30001<_<70000:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    elif 70001<_:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SISterN))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SISterN=[]
for n in range(N):
    _=int(input())
    if _<40000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 40001<_<80000:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    elif 80001<_:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SISterN))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
SISterN=[]
for n in range(N):
    _=int(input())
    if _<40000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)
    elif 40001<_<99000:
        _m= _
        if SISterN.count(_m)==1:
            SISterN.remove(_m)
        else:
            SISterN.append(_m)
    elif 99001<_:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)

print(len(sisterN)+len(SISTERn)+len(SISterN))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
SISTERn=[]
for n in range(N):
    _=int(input())
    if _<50000:
        _s= _
        if sisterN.count(_s)==1:
            sisterN.remove(_s)
        else:
            sisterN.append(_s)

    else:
        _b= _
        if SISTERn.count(_b)==1:
            SISTERn.remove(_b)
        else:
            SISTERn.append(_b)
print(len(sisterN)+len(SISTERn))

Submission status: Time Limit Exceeded

Solution code:
N=int(input())
sisterN=[]
for n in range(N):
    _=int(input())
    if sisterN.count(_)==1:
        sisterN.remove(_)
    else:
        sisterN.append(_)
print(len(sisterN))

Submission status: Time Limit Exceeded

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

paper = []

for a in A:
  if a in paper:
    paper.remove(a)
  else:
    paper.append(a)

print(len(paper))

Submission status: Time Limit Exceeded

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

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

i = 0
while i< len(A):
    C = A.count(A[i])
    P = A[i]
    if(C > 1 and C % 2 == 0):
        for j in range(C):
            A.remove(P)
    elif(C > 1):
        for k in range(C- 1):
            A.remove(P)
        i+= 1
    else:
        i+= 1
    
print(len(A))

Submission status: Time Limit Exceeded

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

for i in range(N):
  list_A.append(input())

i = 0

while i< len(list_A):
  a = list_A[i]
  b = list_A.count(a)
  if(b > 1 and b % 2 == 0):
    for j in range(b):
      list_A.remove(a)
  elif(b > 1):
    for k in range(b- 1):
      list_A.remove(a)
  else:
    i+= 1

ans = len(list_A)

print(ans)

Submission status: Time Limit Exceeded

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

for i in range(N):
  a = input()
  if(a in list_A):
    list_A.remove(a)
  else:
    list_A.append(a)

ans = len(list_A)

print(ans)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

S = list(set(A))
count = 0
for s in S:
    if A.count(s) % 2 == 1:
        count += 1
print(count)

Submission status: Time Limit Exceeded

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

S = list(set(A))
count = [1 for s in S if A.count(s) % 2 == 1]

print(sum(count))

Submission status: Time Limit Exceeded

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

for i in a:
  if i in lis:
    a.remove(i)
  else:
    a.append(i)
    
print(len(lis))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
n=int(input())
a=[int(input()) for i in range(n)]
ans=0
A=set(a)
for i in A:
    if a.count(i)%2==1:
        ans+=1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
n=int(input())
a=[int(input()) for i in range(n)]
A=deque(a)
tmp=[]
while A:
    if A[0] in tmp:
        tmp.remove(A.popleft())
    else:
        tmp.append(A.popleft())
print(len(tmp))

Submission status: Time Limit Exceeded

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[7]:


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


# In[8]:


ans = []
for x in A:
    if x not in ans:
        ans.append(x)
    else:
        ans.remove(x)
print(len(ans))


# In[ ]:

Submission status: Time Limit Exceeded

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

d = []
for i in A:
    if i in d:
        d.remove(i)
    else:
        d.append(i)
print(len(d))

Submission status: Time Limit Exceeded

Solution code:
import sys
n=int(input()) #　a1
lap = [int(input()) for i in range(n)]


ppsum=[]

def delap(ap,psum):
  if len(ap)==0:
    print(len(psum))
    sys.exit(0)
  a=ap[0]

  if ap.count(a)%2 != 0:
    psum.append(a)

  ap=[i for i in ap if i!=a  ]
  delap(ap,psum)

delap(lap,ppsum)

Submission status: Time Limit Exceeded

Solution code:
n=int(input()) #　a1
ap = [int(input()) for i in range(n)]

psum=[]

for a in ap:
  if ap.count(a)%2==0:
    ap.remove(a)
  else:
    psum.append(a)

print(len(psum))

Submission status: Time Limit Exceeded

Solution code:
n=int(input()) #　a1
ap = [int(input()) for i in range(n)]

psum=[]

for a in ap:
  if a in psum:
    psum.remove(a)
  else:
    psum.append(a)

print(len(psum))

Submission status: Time Limit Exceeded

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

ans=[]
for i in a:
    if i in ans:
        ans.remove(i)
    else:
        ans.append(i)

print(len(ans))

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(input()) 
     for nesya in range(n)]
s = set(a)
b = list(sorted(s))
ans = 0
for i in range(len(b)):
  c = a.count(b[i])
  if c%2 == 1:
    ans += 1
  a = [j for j in a if j > b[i]]
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(input()) 
     for nesya in range(n)]
s = set(a)
ans = 0
for i in range(len(s)):
  c = a.count(s.pop())
  if c%2 == 1:
    ans += 1
print(ans)

Submission status: Time Limit Exceeded

Solution code:
n = int(input())
a = [int(input()) for _ in range(n)]
cnt = 0
a_set = set(a)
for i in a_set:
    if a.count(i) % 2 != 0:
        cnt += 1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
from collections import deque
N = int(input())
ans = deque([])
for _ in range(N):
    a = int(input())
    if a not in ans:
        ans.append(a)
    else:
        ans.remove(a)
print(len(ans))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = []
for i in range(N):
    x=[int(i) for i in input().split()]
    if A.count(x) == 0:
        A.append(x)
    else:
        A.remove(x)
print(len(A))

Submission status: Time Limit Exceeded

Solution code:
def main():
    n, *a = map(int, open(0).read().split())
    b = set(a)
    c = list(b)
    ans = 0
    for i in c:
        ans += a.count(i) % 2 == 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Time Limit Exceeded

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

for i in range(N):
    a = input()
    try:
        array.index(a)
        array.remove(a)
    except ValueError:
        array.append(a)

print (len(array))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

b = 0
for i in range(len(a)):
  if a.count(a[i]) % 2 == 0:
    b += 1

print(len(set(a)) - b//2)

Submission status: Time Limit Exceeded

Solution code:
import collections
N = int(input())
A = [int(input()) for i in range(N)]
c = collections.Counter(A)
num = len(c)
for i in range(len(c)):
  if c.most_common()[i][1]%2 == 0:
    num -= 1
print(num)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A.sort()
count = 0
while A:
  a = A[0]
  b = A.count(a)
  if b%2 == 1:
    count += 1
  del A[:b]
print(count)

Submission status: Time Limit Exceeded

Solution code:
N = int(input())
A = [int(input()) for i in range(N)]
A.sort()
count = 0
while A:
  a = A.count(A[0])
  if a%2 == 1:
    count += 1
  del A[:a]
print(count)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n=int(input())
lst=[]
for i in range(n):
  a=int(input())
  if a in lst:
    lst.remove(a)
  elif a not in lst:
    lst.append(a)
print(len(lst))

Submission status: Time Limit Exceeded

Solution code:
N = int(input())

l = []

for i in range(N):
  l.append(int(input()))
  
piyo = list(set(l))

c = 0
for i in piyo:
  if l.count(i) % 2 == 1:

    c += 1

print(c)