Dinesh is very fond of sweets recently his aunt Riya gifted him an array $a$ of sweets of size $N$. The ith sweet is of the type $a[i]$. His mother told him that he can choose one type of sweet in a day and eat at most 2 sweets of that type. Since he has to eat all the sweets as quickly as possible because his cousins are arriving. Find out the minimum number of days in which he can eat all the sweets gifted by his aunt Riya. 
-----Input:-----
- First-line will contain $N$, the number of sweets.  
- The next line will contain $N$ space integers denoting the type of sweets.
-----Output:-----
Output the minimum number of days in which he can eat all the sweets.
-----Constraints-----
- $1 \leq N \leq 10000$
- $1 \leq a[i] \leq 10^3$
-----Sample Input:-----
3
1 2 2
-----Sample Output:-----
2
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
i = 0
count = 0
while(i<n):
 if(i==n-1):
  i+=1
  count+=1
  continue
 if(arr[i]==arr[i+1]):
  i+=2
 else:
  i+=1
 
 count+=1
print(count)
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
i = 0
count = 0
while(i<n):
 if(i==n-1):
  i+=1
  count+=1
  continue
 if(arr[i]==arr[i+1]):
  i+=2
 else:
  i+=1
 
 count+=1
print(count)