#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long int modexp(long long int a, long long int b, long long int m) {
  if (b == 0) return 1;
  if (b == 1) return a % m;
  long long int temp = modexp(a, (b >> 1), m);
  temp = (temp * temp) % m;
  return (temp * modexp(a, b & 1, m)) % m;
}
long long int modinv(long long int a, long long int p) {
  return modexp(a, p - 2, p);
}
int mo = -1, one = 1, zero = 0;
string no = "No", yes = "Yes";
string No = "NO", Yes = "YES";
int a[100000 + 5];
int main() {
  {
    int r, g, b;
    scanf("%d%d%d", &r, &g, &b);
    r++;
    g++;
    b++;
    r /= 2, g /= 2, b /= 2;
    r *= 3, g *= 3, b *= 3;
    r -= 3, g -= 2, b -= 1;
    int p = max(r, max(g, b));
    printf("%d\n", p + 30);
  }
}
