using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;


namespace AtCoder
{
    class AC
    {
        const int mod = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;


        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);
            var cin = new Scanner();
            int N = int.Parse(Console.ReadLine());

            List<Tuple<int, int>> c = new List<Tuple<int, int>>();

            for(var i = 0; i < N; i++)
            {
                var p = cin.SplitReader();
                c.Add(new Tuple<int, int>(p[0], p[1]));
            }

            c.Sort((a, b) => (a.Item1 + a.Item2 - b.Item1 - b.Item2));
            long ans = 0;
            for(var i = 0; i < N; i++)
            {
                int l = c.Count() - 1;
                
                if (i % 2 == 0)
                {
                    ans += c[l].Item1;
                    c.RemoveAt(l);
                }
                else
                {
                    ans -= c[l].Item2;
                    c.RemoveAt(l);
                }
            }

            Console.WriteLine(ans);

            //Console.Out.Flush();
        }
       
    }
        public class Scanner
        {
            public int[] SplitReader()
            {
                int[] array = Console.ReadLine().Split().Select(int.Parse).ToArray();
                return array;
            }
            public long[] SplitReaderL()
            {
                long[] array = Console.ReadLine().Split().Select(long.Parse).ToArray();
                return array;
            }
        }

        public static class Tool
        {
            static public void Initialize<T>(ref T[] array, T initialvalue)
            {
                for (var i = 0; i < array.Length; i++)
                {
                    array[i] = initialvalue;
                }
            }
            static public long ModuloP(long value, long mod)
            {
                long r = value % mod;

                if (r * mod < 0)
                {
                    r += mod;
                }
                return r;
            }

        }

        struct Pair<T> : IComparable<Pair<T>> where T : IComparable<T>
        {
            public T variable;
            public int index;

            public Pair(T val, int i)
            {
                variable = val;
                index = i;
            }

            public int CompareTo(Pair<T> otherPair)
            {
                return variable.CompareTo(otherPair.variable);
            }

            public int CompareIndex(Pair<T> otherPair)
            {
                return index.CompareTo(otherPair.index);
            }
        }
    public class PriorityQueue<T> where T : IComparable<T>
    {

        private List<T> Q;
        private readonly int r;

        public PriorityQueue(bool ascending)
        {
            if (ascending)
            {
                r = 1;
            }
            else
            {
                r = -1;
            }
            Q = new List<T>();
        }


        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (list[n].CompareTo(list[pIndex]) * r > 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }

        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {

                    comp = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
                }

                if (list[cur].CompareTo(list[comp]) * r < 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }

        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }



        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int CountItem()
        {
            return Q.Count();
        }
    }


}






Measured memory_bytes: 21300