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

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Linq;
using System.Collections;
using System.Collections.Generic;

namespace Brown
{
    using static Ex;
    public class Solve
    {
        public static void Main(string[] args)
        {
            new abc073_c();
        }
    }
    public class abc073_c
    {
        public abc073_c()
        {
            int n = ReadInt;
            var set = new HashSet<long>();
            int ans = 0;
            for (int i = 0; i < n; i++)
            {
                long a = ReadLong;
                if (set.Contains(a))
                {
                    ans--;
                    set.Remove(a);
                }
                else
                {
                    ans++;
                    set.Add(a);
                }
            }
            ans.Cw();
        }
    }
    public class abc144_d
    {
        int a, b, x;
        public abc144_d()
        {
            (a, b, x) = ReadIntArray().ToTpl3();

            int max = a * a * b;

        }
    }
    public class abc061_c
    {
        long n, k, a, b;
        public abc061_c()
        {
            (n, k) = ReadLongArray().ToTpl2();

            var arr = new long[(int)1e5 + 1];

            for (long i = 0; i < n; i++)
            {
                (a, b) = ReadLongArray().ToTpl2();
                arr[a] += b;
            }
            for (long i = 1; i <= (int)1e5; i++)
            {
                arr[i] += arr[i - 1];
                if (arr[i] > k)
                {
                    i.Cw();
                    return;
                }
            }
        }
    }
    public class abc136_d
    {
        public abc136_d()
        {
            var s = Read.ToArray();
            //var s = Read.Select(v => v == 'L' ? -1 : 1).ToArray();
            var arr = new int[s.Length];
        }
    }
    public class abc149_d
    {
        int n, k;
        public abc149_d()
        {
            (n, k) = ReadIntArray().ToTpl2();
            var score = ReadIntArray();
            var t = Read.Select(c =>
            {
                switch (c)
                {
                    case 'r': return 2;
                    case 's': return 0;
                    case 'p': return 1;
                };
                return 0;
            }).ToArray();

            long ans = 0;
            var arr = new int[n];
            for (int i = 0; i < n; i++)
            {
                var c = t[i];
                if (i >= k && (c == arr[i - k]))
                {
                    for (int a = 0; a < 3; a++)
                    {
                        if (a == c) continue;
                        if ((i + k < n) && a == t[i + k]) continue;
                        c = a;
                        break;
                    }
                }
                else
                {
                    ans += score[c];
                }
                arr[i] = c;
            }
            ans.Cw();
        }
    }
    public class abc_
    {
        public abc_()
        {
        }
    }

    public static class Ex
    {
        public static void Cw(this object s) { Console.WriteLine(s); }



        public static bool Mins<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
        public static bool Maxs<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
        public static void Swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
        public static void Swap<T>(List<T> list, int i, int j) { T tmp = list[j]; list[j] = list[i]; list[i] = tmp; }

        public static long Lcm(int x, int y) { return x / Gcd(x, y) * y; }
        public static long Gcd(long m, long n) { if (n == 0) return m; return Gcd(n, m % n); }
        public static List<string> FastSort(this List<string> s) { s.Sort(StringComparer.Ordinal); return s.ToList(); }
        public static void yesno(this bool b) { (b ? "yes" : "no").Cw(); }
        public static void YesNo(this bool b) { (b ? "Yes" : "No").Cw(); }
        public static void YESNO(this bool b) { (b ? "YES" : "NO").Cw(); }

        public static string Read { get { return Console.ReadLine().Trim(); } }
        public static int ReadInt { get { return int.Parse(Read); } }
        public static long ReadLong { get { return long.Parse(Read); } }
        public static double ReadDouble { get { return double.Parse(Read); } }
        public static string[] ReadArray() { return Read.Split(' '); }
        public static int[] ReadIntArray() { return Read.Split(' ').Select(int.Parse).ToArray(); }
        public static long[] ReadLongArray() { return Read.Split(' ').Select(long.Parse).ToArray(); }
        public static string[] ReadArray(long N) { var v = new string[N]; for (long i = 0; i < N; ++i) v[i] = Read; return v; }
        public static int[] ReadIntArray(long N) { var v = new int[N]; for (long i = 0; i < N; ++i) v[i] = ReadInt; return v; }
        public static long[] ReadLongArray(long N) { var v = new long[N]; for (long i = 0; i < N; ++i) v[i] = ReadLong; return v; }

        public static (T, T) ToTpl2<T>(this T[] v) { return (v[0], v[1]); }
        public static (T, T, T) ToTpl3<T>(this T[] v) { return (v[0], v[1], v[2]); }
        public static (T, T, T, T) ToTpl4<T>(this T[] v) { return (v[0], v[1], v[2], v[3]); }
        public static (T, T, T, T, T) ToTpl5<T>(this T[] v) { return (v[0], v[1], v[2], v[3], v[4]); }


    }
}