Someday, Drazil wanted to go on date with Varda. Drazil and Varda live on Cartesian plane. Drazil's home is located in point (0, 0) and Varda's home is located in point (a, b). In each step, he can move in a unit distance in horizontal or vertical direction. In other words, from position (x, y) he can go to positions (x + 1, y), (x - 1, y), (x, y + 1) or (x, y - 1).

Unfortunately, Drazil doesn't have sense of direction. So he randomly chooses the direction he will go to in each step. He may accidentally return back to his house during his travel. Drazil may even not notice that he has arrived to (a, b) and continue travelling.

Luckily, Drazil arrived to the position (a, b) successfully. Drazil said to Varda: "It took me exactly s steps to travel from my house to yours". But Varda is confused about his words, she is not sure that it is possible to get from (0, 0) to (a, b) in exactly s steps. Can you find out if it is possible for Varda?

Input
You are given three integers a, b, and s ( - 109 ≤ a, b ≤ 109, 1 ≤ s ≤ 2·109) in a single line.

Output
If you think Drazil made a mistake and it is impossible to take exactly s steps and get from his home to Varda's home, print "No" (without quotes).

Otherwise, print "Yes".
问题链接：https://vjudge.net/contest/274223#problem/H
问题简述：输入坐标a，b，和步数s，判断是否能从（0，0）出发经s步到（a，b）。
问题分析：除了到（a，b）所必要的步数外，若剩余步数为偶数，则满足条件。
程序说明：用if语句取a，b的绝对值，再判断。
AC通过的C++程序如下：

include<iostream>

using namespace std;
int main()
{
int s, a, b,n;
cin >> a >> b>> s;
if (a < 0)
a = 0 - a;
if (b < 0)
b = 0 - b;
n = s - a - b;
if (n % 2 != 0||n<0)
cout << "NO";
else cout << "YES";
return 0;
}