#include <bits/stdc++.h>
using namespace std;
long long int i, j, a, k, b, c, n, t = 1, m, p, q, d, e, f, y, g, z, h, r, l, u,
                                   x, o, ar[10005];
long double aa, bb, ee, dd, ff, kk, gg;
vector<long long int> v, s, sgt;
vector<long long int> vv[10005], ss;
map<pair<long long int, long long int>, long long int> me, se;
map<long long int, long long int> sa, ta, pa, ma;
priority_queue<pair<long long int, pair<long long int, long long int> > > aq,
    tq, pq;
string st, et, ft, pt, ct, dt;
deque<char> de, pe, ne;
long long int dfs(long long int a) {
  long long int i, j, k, b, c, d;
  ar[a] = 1;
  for (i = 0; i < vv[a].size(); i++) {
    if (ar[vv[a][i]] == 0) {
      ar[vv[a][i]] = 1;
      dfs(vv[a][i]);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  while (t--) {
    cin >> a >> b >> d;
    c = 0;
    if (abs(a - b) >= 1) c++;
    c = c + (min(a, b) * 2);
    c = c + (d * 2);
    cout << c << endl;
  }
}
