CF515A.Drazil and Date

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?

某天，Drazil 想要和 Varda 约会。Drazil 和 Varda 都住在笛卡尔平面上。Drazil 的家位于点 $(0, 0)$，而 Varda 的家位于点 $(a, b)$。每一步，他可以在水平或竖直方向上移动一个单位距离。换句话说，从位置 $(x, y)$ 出发，他可以走到 $(x + 1, y)$、$(x - 1, y)$、$(x, y + 1)$ 或 $(x, y - 1)$。

不幸的是，Drazil 没有方向感，因此他在每一步都随机选择移动方向。在旅途中，他可能会不小心走回家；甚至可能在到达 $(a, b)$ 后仍未察觉，继续行走。

幸运的是，Drazil 最终成功抵达了位置 $(a, b)$。他对 Varda 说：“我恰好用了 $s$ 步，从我家走到你家。” 但 Varda 对他的话感到困惑——她不确定是否真的能恰好用 $s$ 步从 $(0, 0)$ 到达 $(a, b)$。你能帮 Varda 判断这是否可能吗？

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

给你一行中的三个整数 $a$、$b$ 和 $s$（满足 $-10^9 \le a, b \le 10^9$，$1 \le s \le 2 \cdot 10^9$）。

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".

如果你认为德拉齐尔犯了一个错误，即不可能恰好走 s 步从他家到达瓦尔达家，则输出 "No"（不带引号）。

否则，输出 "Yes"。

In fourth sample case one possible route is: .

在第四个样例中，一种可能的路径是：。