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;
#pragma comment(linker, "/STACK:200000000")
const double EPS = 1E-9;
const int INF = 1000000000;
const long long INF64 = (long long)1E18;
const double PI = 3.1415926535897932384626433832795;
map<vector<long long>, long long> z;
long long rec(vector<long long> a) {
  sort(a.begin(), a.end());
  if (z.count(a)) return z[a];
  for (int i = 0; i < (int)(2); i++)
    if (a[i] == a[i + 1]) return a[i];
  long long res = INF64;
  if (a[0]) {
    vector<long long> b(a);
    long long t = b[0];
    b[0] -= t;
    b[1] -= t;
    b[2] += t;
    res = min(res, t + rec(b));
  }
  if (a[0]) {
    vector<long long> b(a);
    long long t = min(b[0], (b[2] - b[1] + 1) / 2);
    b[0] -= t;
    b[2] -= t;
    b[1] += t;
    res = min(res, t + rec(b));
  }
  if (a[1]) {
    vector<long long> b(a);
    long long t = min(b[1], (b[1] - b[0] + 1) / 2);
    b[1] -= t;
    b[2] -= t;
    b[0] += t;
    res = min(res, t + rec(b));
  }
  return z[a] = res;
}
long long solve(vector<long long> a) {
  sort(a.begin(), a.end());
  if (int(a[0] % 2 != a[2] % 2) + int(a[1] % 2 != a[2] % 2) == 1)
    return a[2];
  else
    return a[1];
}
int main() {
  vector<long long> a(3);
  for (int i = 0; i < (int)(3); i++) cin >> a[i];
  long long res = solve(a);
  cout << res << endl;
  return 0;
}
