using System;
namespace EqualPairs
{
    class EqualPairs
    {
        static void Main(string[] args)
        {
            int n = Integer.parseInt(console.nextLine());
            int currSum = 0;
            int prevSum = 0;
            int diff = 0;
            int maxDiff = 0;
            for (int i = 0; i < n; i++)
            {
                prevSum = currSum;
                currSum = 0;
                currSum += Integer.parseInt(console.nextLine());
                currSum += Integer.parseInt(console.nextLine());
                if (i != 0)
                {
                    diff = Math.Abs(currSum - prevSum);
                    if (diff != 0 && diff > maxDiff)
                    {
                        maxDiff = diff;
                    }
                }

            }
            if (prevSum == currSum || n == 1)
            {
                 System.out.println("Yes, value={0}", currSum);
            }
            else
            {
                System.out.println("No, maxdiff={0}", maxDiff);
            }
        }
    }
}