CodeForces 950A Left-handers, Right-handers and Ambidexters

Problem Description

You are at a water bowling training. There are l people who play with their left hand, r people, who play with their right hand, and a ambidexters, who can play with left or right hand.

The coach decided to form a team of even number of players, exactly half of the players should play with their right hand, and exactly half of the players should play with their left hand. One player should use only on of his hands.

Ambidexters play as well with their right hand as with their left hand. In the team, an ambidexter can play with their left hand, or with their right hand.

Please find the maximum possible size of the team, where equal number of players use their left and right hands, respectively.

Input

The only line contains three integers l, r and a (0 ≤ l, r, a ≤ 100) — the number of left-handers, the number of right-handers and the number of ambidexters at the training.

Output

Print a single even integer — the maximum number of players in the team. It is possible that the team can only have zero number of players.

Examples

input

1 4 2

output

6

input

5 5 5

output

14

input

0 2 0

output

0

Note

In the first example you can form a team of 6 players. You should take the only left-hander and two ambidexters to play with left hand, and three right-handers to play with right hand. The only person left can’t be taken into the team.

In the second example you can form a team of 14 people. You have to take all five left-handers, all five right-handers, two ambidexters to play with left hand and two ambidexters to play with right hand.

题解代码

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main() {
    int l,r,a;
    cin >> l >> r >> a;
    if(l < r){
        while(l < r && a > 0){
            l++;
            a--;
        }
        cout << 2 * min(l + a / 2, r + a / 2) << endl;
    }
    else if(l > r){
        while(l > r && a > 0){
            r++;
            a--;
        }
        cout << 2 * min(l + a / 2, r + a / 2) << endl;
    }
    else if(l == r){
        cout << (l + a / 2) * 2 << endl;
    }
    return 0;
}