9 530792195 6
 0 0 10
 1944219055 454183506 1369298327
 914835 2742837 9234739
 10 10 0
 2 2 0
 0 0 1
 3 10 1007169359
 0 1 0
 1016450951 2 9
 0 2 10
 2147483648 0 2147483647
 92134834 23742837 92374738
 1 4 3
 382601556 881329640 791556039
 0 0 58
 5 10 6
 10 6 8
 6 8 10
 3 2 0
 1 4 4
 2147483630 2147483642 2147483610
 1 0 0
 18 67 5
 50606342 2 1134945035
 8 97 83
 2147483648 0 0
 92134834 23742837 92374737
 5 0 5
 772486757 1747374885 377299255
 1 0 1
 1 2 3
 0 3 2
 2147483648 2147483647 2147483648
 51 10 91
 9214834 2742837 9234739
 1 2 2147483648
 67 81 1
 92134834 23742837 92374739
 2 7 95
 3 0 2
 5 9 0
 1 10 2
 246543403 71853598 1504509195
 2147483648 2147483648 2147483648
 48 6 7
 2147483648 2147483648 0
 1358352906 27037371 1947040615

                                                       530792195
                                                                0
                                                       1944219055
                                                          2742837
                                                               10
                                                                2
                                                                0
                                                       1007169359
                                                                0
                                                       1016450951
                                                                2
 2147483648                                                         92374738
                                                                3
                                                        881329640
                                                                0
                                                               10
                                                                8
                                                                8
                                                                2
                                                                4
                                                       2147483630
                                                                0
                                                               67
                                                         50606342
                                                               97
                                                                0
                                                         92374737
                                                                5
                                                        772486757
                                                                1
                                                                3
                                                                2
 2147483648                                                               91
                                                          9234739
 2147483648                                                               67
                                                         92374739
                                                               95
                                                                2
                                                                9
                                                               10
                                                       1504509195
 2147483648                                                               48
 2147483648                                                       1947040615

#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int intmax = 0x3f3f3f3f;
double eps = 1e-6;
template <class T>
inline void checkmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline T lowbit(T n) {
  return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
  return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T checkmod(T n, T m) {
  return (n % m + m) % m;
}
inline int rand(int a, int b) {
  if (a >= b) return a;
  return rand() % (b - a) + a;
}
template <class T>
inline T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
inline T lcm(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
template <class T>
inline T euclid(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = euclid(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = euclid(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = euclid(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <class T>
inline vector<pair<T, int> > factorize(T n) {
  vector<pair<T, int> > R;
  for (T i = 2; n > 1;) {
    if (n % i == 0) {
      int C = 0;
      for (; n % i == 0; C++, n /= i)
        ;
      R.push_back(make_pair(i, C));
    }
    i++;
    if (i > n / i) i = n;
  }
  if (n > 1) R.push_back(make_pair(n, 1));
  return R;
}
template <class T>
inline bool isPrimeNumber(T n) {
  if (n <= 1) return false;
  for (T i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
template <class T>
inline T eularFunction(T n) {
  vector<pair<T, int> > R = factorize(n);
  T r = n;
  for (int i = 0; i < R.size(); i++) r = r / R[i].first * (R[i].first - 1);
  return r;
}
template <class T>
inline int dblcmp(T a, const T b) {
  a -= b;
  return a > eps ? 1 : (a < -eps ? -1 : 0);
}
template <class T>
inline int sgn(T a) {
  return a > eps ? 1 : (a < -eps ? -1 : 0);
}
struct vec2 {
  double x, y;
  vec2(double x = 0.0, double y = 0.0) : x(x), y(y) {}
  vec2 operator+(const vec2 &b) const { return vec2(x + b.x, y + b.y); }
  vec2 operator-(const vec2 &b) const { return vec2(x - b.x, y - b.y); }
  vec2 operator*(const double &b) const { return vec2(x * b, y * b); }
  vec2 operator/(const double &b) const { return vec2(x / b, y / b); }
  double operator*(const vec2 &b) const { return x * b.x + y * b.y; }
  double operator^(const vec2 &b) const { return x * b.y - y * b.x; }
  double len() { return sqrt(x * x + y * y); }
  vec2 unit() { return *this / len(); }
  vec2 rotate(double r) {
    vec2 t(sin(r), cos(r));
    return vec2(*this ^ t, *this * t);
  }
  bool operator<(const vec2 &b) const {
    if (dblcmp(x, b.x) != 0)
      return dblcmp(x, b.x) < 0;
    else
      return dblcmp(y, b.y) < 0;
  }
};
int main() {
  long long a, b, c, ans;
  while (cin >> a >> b >> c) {
    ans = a + b + c + 10;
    if ((a & 1) == (b & 1)) checkmin(ans, max(a, b));
    if ((a & 1) == (c & 1)) checkmin(ans, max(a, c));
    if ((b & 1) == (c & 1)) checkmin(ans, max(b, c));
    cout << ans << endl;
  }
  return 0;
}
