from collections import Counter,defaultdict,deque

from heapq import heapify,heappop,heappush

import sys,bisect,math,itertools,string,queue

sys.setrecursionlimit(10**8)

mod = 10**9+7

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))

def inpl_str(): return list(sys.stdin.readline().split())

def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))



a,b,c = inpl()

if a + b + 1 >=  c:

    print((b+c))

else:

    print((a+b+1+b))



from collections import Counter,defaultdict,deque

from heapq import heappop,heappush

from bisect import bisect_left,bisect_right 

import sys,math,itertools,fractions

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



a,b,c = inpl()

if b >= c:

    print((b+c))

    exit()

if a < c-b:

    print((a+2*b+1))

else:

    print((b+c))

from collections import Counter, defaultdict, deque
from heapq import heapify, heappop, heappush
import sys, bisect, math, itertools, string, queue

sys.setrecursionlimit(10**8)
mod = 10**9 + 7


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


def inpl_str():
    return list(sys.stdin.readline().split())


def inpln(n):
    return list(int(sys.stdin.readline()) for i in range(n))


a, b, c = inpl()
if a + b + 1 >= c:
    print((b + c))
else:
    print((a + b + 1 + b))

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


a, b, c = inpl()
if b >= c:
    print((b + c))
    exit()
if a < c - b:
    print((a + 2 * b + 1))
else:
    print((b + c))

-from heapq import heapify, heappop, heappush -import sys, bisect, math, itertools, string, queue +from heapq import heappop, heappush +from bisect import bisect_left, bisect_right +import sys, math, itertools, fractions +INF = float("inf") -def inpl_str(): -    return list(sys.stdin.readline().split()) - - -def inpln(n): -    return list(int(sys.stdin.readline()) for i in range(n)) - - -if a + b + 1 >= c: +if b >= c: +    exit() +if a < c - b: +    print((a + 2 * b + 1)) -    print((a + b + 1 + b)) +    print((b + c))