{"problem":{"name":"Table Tennis Training","description":{"content":"$2N$ players are running a competitive table tennis training on $N$ tables numbered from $1$ to $N$. The training consists of _rounds_. In each round, the players form $N$ pairs, one pair per table. I","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc041_a"},"statements":[{"statement_type":"Markdown","content":"$2N$ players are running a competitive table tennis training on $N$ tables numbered from $1$ to $N$.\nThe training consists of _rounds_. In each round, the players form $N$ pairs, one pair per table. In each pair, competitors play a match against each other. As a result, one of them wins and the other one loses.\nThe winner of the match on table $X$ plays on table $X-1$ in the next round, except for the winner of the match on table $1$ who stays at table $1$.\nSimilarly, the loser of the match on table $X$ plays on table $X+1$ in the next round, except for the loser of the match on table $N$ who stays at table $N$.\nTwo friends are playing their first round matches on distinct tables $A$ and $B$. Let's assume that the friends are strong enough to win or lose any match at will. What is the smallest number of rounds after which the friends can get to play a match against each other?\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^{18}$\n*   $1 \\leq A < B \\leq N$\n*   All input values are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc041_a","tags":[],"sample_group":[["5 2 4","1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table $3$ and play each other in the next round."],["5 2 3","2\n\nIf both friends win two matches in a row, they will both move to table $1$."]],"created_at":"2026-03-03 11:01:14"}}