function solve(input) {
    let n = Number(input.shift());

    let maxNum = Number.MIN_SAFE_INTEGER;
    let minNum = Number.MAX_SAFE_INTEGER;
    let value = 0;
    let lastPair = 0;
    let currentPair = 0;
    let maxNumDiff = 0;

    for (let i = 1; i <= n; i++) {
        let num1 = Number(input.shift());
        let num2 = Number(input.shift());

        if (i > 1) {
            lastPair = num1 + num2;

            if (currentPair === lastPair) {
                value = currentPair;
            }
            else {
                if (currentPair > maxNum) {
                    maxNum = currentPair;
                }
                if (lastPair > maxNum) {
                    maxNum = lastPair;
                }
                if (currentPair < minNum) {
                    minNum = currentPair;
                }
                if (lastPair < minNum) {
                    minNum = lastPair;
                }
                maxNumDiff = maxNum - minNum;
            }

        }
        else {
            currentPair = num1 + num2;

            if (n <= 1) {
                value = num1 + num2;
                lastPair = currentPair;
            }
        }

    }

    if (currentPair === lastPair) {
        console.log(`Yes, value=${value}`)
    }
    else if (currentPair != lastPair){
        console.log(`No, maxdiff=${maxNumDiff}`)
    }

}