#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
long long gcd(long long a, long long b) {
  int temp;
  while (b > 0) {
    temp = a % b;
    a = b;
    b = temp;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long modpow(long long a, long long n) {
  long long p = 1;
  while (n) {
    if (n % 2) p = p * a % 100019;
    n /= 2;
    a = a * a % 100019;
  }
  return p;
}
int main() {
  long long a, b, s;
  cin >> a >> b >> s;
  if (abs(a) + abs(b) > s) {
    cout << "No";
    return 0;
  }
  if ((s - abs(a) + abs(b)) % 2 == 0)
    cout << "Yes";
  else
    cout << "No";
}
