open Printf open Scanf
module Lib = struct
  let i32,i64,ist = Int64.(to_int,of_int,to_string)
  let (+$) = (+) let (-$) = (-) let (/$) = (/) let ( *$) = ( * ) let (%$) = (mod)
  let labs = Int64.abs
  let (+),(-),( * ),(/),(mod),(%) = Int64.(add,sub,mul,div,rem,rem)
  let (+=) r v = r := !r + v
  let (-=) r v = r := !r - v
  let ( *= ) r v = r := !r * v
  let (/=) r v = r := !r / v
  let (%=) r v = r := !r % v
  let max_i64,min_i64 = Int64.(max_int,min_int)
  (* math *)
  let ceildiv p q = (p+q-1L) / q
  let rec gcd m n = match m,n with | m,0L -> m | m,n -> gcd n (m mod n)
  let lcm m n = m / gcd m n * n
  module Int64_infix = struct
    let (land),(lor),(lxor),lnot,(lsl),(lsr),(asr) =
      let open Int64 in
      (logand),(logor),(logxor),lognot,
      (fun u v -> shift_left u (i32 v)),
      (fun u v -> shift_right u (i32 v)),
      (fun u v -> shift_right_logical u (i32 v))
  end
  let pow n k =
    let rec f a n = function
    | 0L -> a | 1L -> n*a | k when k mod 2L = 0L -> f a (n*n) (k/2L) | k -> f (a*n) (n*n) (k/2L)
    in f 1L n k
  (* input *)
  let input_i64_array n = Array.init (i32 n) (fun _ -> Scanf.scanf " %Ld" (fun v -> v)) let iia = input_i64_array
  let get_i64 _ = Scanf.scanf " %Ld" (fun v -> v) let gi = get_i64
  let get_2_i64 _ = Scanf.scanf " %Ld %Ld" (fun u v -> u,v) let g2 = get_2_i64
  let get_3_i64 _ = Scanf.scanf " %Ld %Ld %Ld" (fun u v w -> u,v,w) let g3 = get_3_i64
  let get_4_i64 _ = Scanf.scanf " %Ld %Ld %Ld %Ld" (fun u v w x -> u,v,w,x) let g4 = get_4_i64
  let get_5_i64 _ = Scanf.scanf " %Ld %Ld %Ld %Ld %Ld" (fun u v w x y -> u,v,w,x,y) let g5 = get_5_i64
  let i32_get_int _ = Scanf.scanf " %d" (fun v -> v) let i32_get_2_ints _ = Scanf.scanf " %d %d" (fun u v -> u,v) let i32_get_3_ints _ = Scanf.scanf " %d %d %d" (fun u v w -> u,v,w) let i32_get_4_ints _ = Scanf.scanf " %d %d %d %d" (fun u v w x -> u,v,w,x) let i32_get_5_ints _ = Scanf.scanf " %d %d %d %d %d" (fun u v w x y -> u,v,w,x,y)
  (* utils *)
  external id : 'a -> 'a = "%identity"
  let ( *< ) f g x = f (g x)
  let ( *> ) f g x = g (f x)
  let rv f p q = f q p (* ex. 24 |> rv (/) 6 *)
  let alen a = i64 @@ Array.length a
  let llen l = i64 @@  List.length l
  let slen s = String.length s
  let string_of_list ?(separator=" ") f ls = ls |> List.map f |> String.concat separator
  let string_of_array ?(separator=" ") f a = a |> Array.to_list |> string_of_list ~separator f
  let char_list_of_string str = let rec f0 i a = if i<0 then a else f0 (i-$1) (str.[i]::a) in f0 (String.length str -$ 1) []
  let string_of_char_list ls = List.fold_left (fun u v -> u ^ (String.make 1 v)) "" ls
  let fail _ = failwith "fail"
  let dx,dy = [|1;0;-1;0|],[|0;1;0;-1|]
  let range l r = let ls = ref [] in for i=i32 l to i32 r do ls := i :: !ls done;!ls |> List.rev
  let cartesian_product u v = u |> List.map (fun p -> List.map (fun q -> p,q) v) |> List.flatten
  let shuffle a = Array.sort (fun _ _ -> (Random.int 3) -$ 1) a
  let binary_search ng ok f = let d = if ng < ok then 1L else -1L in
    let rec f0 ng ok =
      if labs (ok - ng) <= 1L then ok
      else let mid = ng + (ok - ng) / 2L in if f mid then f0 ng mid else f0 mid ok
    in f0 (ng-1L*d) (ok+1L*d)
  let lower_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >= v)
  let upper_bound a v = binary_search 0L (alen a - 1L) (fun i -> a.(i32 i) >  v)
  let equal_range a v = lower_bound a v, upper_bound a v (* #=snd-fst *)
  let rec fix f x = f (fix f) x
  let fix_memo ?(size=10000) f x =
    let tb = Hashtbl.create ~random:true size in
    let rec f0 x =
      try Hashtbl.find tb x with
      | Not_found -> (let v = f f0 x in Hashtbl.add tb x v; v)
    in f0 x
  (* imperative *)
  let rep f t ?(stride=1L) fbod = let i = ref f in while !i <= t do fbod !i; i := !i + stride done
  let repb f t ?(stride=1L) fbod = let i,c = ref f,ref true in while !i <= t && !c do
    match fbod !i with | `Break -> c := false | `Ok -> i := !i + stride done
  let repm f t ?(stride=1L) m0 fbod =
    let i,c,m = ref f,ref true,ref m0 in
    while !i<=t && !c do match fbod !m !i with
    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i + stride done; !m
  let repi f t ?(stride=1) fbod = let i = ref f in while !i <= t do fbod !i; i := !i +$ stride done
  let repib f t ?(stride=1) fbod = let i,c = ref f,ref true in while !i <= t && !c do
    match fbod !i with | `Break -> c := false | `Ok -> i := !i +$ stride done
  let repim f t ?(stride=1) m0 fbod =
    let i,c,m = ref f,ref true,ref m0 in
    while !i<=t && !c do match fbod !m !i with
    | `Break -> c := false | `Break_m m' -> (c := false; m := m') | `Ok m' -> m := m'; i := !i +$ stride done; !m
  let rep_rev f t ?(stride=1L) fbod = rep t f ~stride @@ fun v -> fbod @@ f + t - v
  let repb_rev f t ?(stride=1L) fbod = repb t f ~stride @@ fun v -> fbod @@ f + t - v
  let repm_rev f t ?(stride=1L) m0 fbod = repm f t ~stride m0 @@ fun u v -> fbod u @@ f + t - v
  let repi_rev f t ?(stride=1) fbod = repi t f ~stride @@ fun v -> fbod @@ f +$ t -$ v
  let repib_rev f t ?(stride=1) fbod = repib t f ~stride @@ fun v -> fbod @@ f +$ t -$ v
  let repim_rev f t ?(stride=1) m0 fbod = repim f t ~stride m0 @@ fun u v -> fbod u @@ f +$ t -$ v
  (* output *)
  let print_list_mle f ls = string_of_list f ls |> print_endline
  let print_array_mle f a = string_of_array f a |> print_endline
  let print_list f ls = ls |> List.iter (fun v -> printf "%s " @@ f v); print_newline ()
  let print_array f a = a |> Array.iter (fun v -> printf "%s " @@ f v); print_newline ()
  (* debug *)
  let dump_2darr f a = a |> Array.iter (fun b -> print_array f b)
  let dump_i64_list ls = print_list ist ls
  let dump_i64_array a = print_array ist a
end open Lib open Array
module CumulSumArray = struct
  let make a =
    let ln = Array.length a
    in let a1 = Array.make (ln+$1) 0L in for i=1 to ln do a1.(i) <- a1.(i-$1) + a.(i-$1) done; a1
  let sum l r a = (* 0-origin,closed *)
    if l>r then 0L else (a.(r+$1) - a.(l))
  let sum_1orig l r a = sum (l-$1) (r-$1) a
end
module Imos = struct
  let make n = Array.make (i32 n +$ 2) 0L
  let add_destructive_closed l r a =
    a.(l+$1) <- a.(l+$1) + 1L;
    a.(r+$2) <- a.(r+$2) - 1L
  let add_destructive_1orig_closed l r a =
    a.(l) <- a.(l) + 1L;
    a.(r+$1) <- a.(r+$1) - 1L
  let add_destructive_1orig_closed_safe l r a =
    let l = max l 0 in a.(l) <- a.(l) + 1L;
    let r = min (r+$1) (Array.length a-$1) in a.(r) <- a.(r) - 1L
  let cumulate_destructive a =
    for i=1 to Array.length a -$ 2 do a.(i) <- a.(i) + a.(i-$1) done
end
module NumTheory = struct
  let sieve n = (* includes 0, O(nloglogn) *)
    let n = i32 n in
    let prime = Array.make (n+$1) true in
    prime.(0) <- false;
    prime.(1) <- false;
    for i=2 to n do
      if prime.(i) then let j = ref @@ i*$2 in
      while !j <= n do prime.(!j) <- false; j := !j +$ i; done
    done; prime
  let divisors_1_to_n n = (* O(nloglogn) *)
    let res = Array.make (n+$1) [] in
    for i=1 to n do
      let j = ref @@ i in
      while !j <= n do res.(!j) <- i::res.(!j); j := !j +$ i; done;
      res.(i) <- List.rev res.(i)
    done; res
  let divisors v = (* O(sqrt n) *)
    (* converting each to i32 is hopelessly slow
       (especially in Codeforces. ex: 1061C);
       use divisors_i32 instead *)
    let rec f0 i a =
      if i*i > v then a
      else if i*i = v && v mod i = 0L then i::a
      else if v mod i = 0L then f0 (i+1L) (i::(v/i)::a)
      else f0 (i+1L) a in f0 1L []
  let divisors_i32 n = (* O(sqrt n) *)
    let rec f0 i a =
      if i*$i > n then a
      else if i*$i = n && n %$ i = 0 then i::a
      else if n %$ i = 0 then f0 (i+$1) (i::(n/$i)::a)
      else f0 (i+$1) a in f0 1 []
  let factors n = (* O(sqrt n) *)
    (* [(p,k)] where p is prime, Πp^k=n *)
    let m,r = ref n,ref [] in
    rep 2L (2L + Int64.of_float (sqrt @@ Int64.to_float n)) (fun i ->
      if !m mod i = 0L then (
        let k = ref 0L in
        while !m mod i = 0L do
          k += 1L; m /= i;
        done;
        r := (i,!k) :: !r));
    if !m>1L then (!m,1L)::!r else !r
  let powers n limit =
    let rec f0 i r =
      if i>limit then r
      else f0 (i*n) (i::r)
    in f0 1L [] |> List.rev
  let pow n k =
    let rec f a n = function
    | 0L -> a
    | 1L -> n*a
    | k when k mod 2L = 0L -> f a (n*n) (k/2L)
    | k -> f (a*n) (n*n) (k/2L)
    in f 1L n k
end
module IMap = Map.Make(Int64)
let sort_with_index a =
  let a0 = Array.init (Array.length a) (fun i -> a.(i),i)
  in Array.sort compare a0; a0
  (* in Array.sort (fun (u,i) (v,j) -> let r = compare u v in if r = 0 then compare i j else r) a0; a0 *)
let appearance a = (* (value,count) *)
  Array.fold_left (fun u v -> IMap.add v (1L + try IMap.find v u with Not_found -> 0L) u) IMap.empty a
let () =
  let a,b,c = g3 0 in
  let v = if c <= a+b then (
    c+b
  ) else if a <= c-b then (
    a+b*2L+1L
  ) else (
    c+b
  )
  in printf "%Ld" v








