import java.util.Scanner;

public class EqualPairs {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.nextLine());
        int sum = 0;
        int oldSum = 0;
        int diff = 0;
        int oldDiff = 0;

        for (int i = 0; i < n * 2; i++) {
            int num = Integer.parseInt(scanner.nextLine());
            sum += num;
            if (i % 2 == 1) {
                if (oldSum == sum) {
                    oldSum = 0;
                }
                else if (i > 2) {
                    diff = Math.abs(oldSum - sum);
                    if (diff > oldDiff) {
                        oldDiff = diff;
                        diff = 0;
                    }
                }
                if (oldSum != sum) {
                    oldSum = sum;
                    sum = 0;
                }
            }
        }
        if (oldDiff == 0) {
            System.out.printf("Yes, value=%d", oldSum);
        }
        else {
            System.out.printf("No, maxdiff=%d", oldDiff);
        }
    }
}