Problem:
Score : 300 points

Problem Statement

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.
In each pair, competitors play a match against each other.
As a result, one of them wins and the other one loses.

The 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.

Similarly, 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.

Two 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?

Constraints

2 \leq N \leq 10^{18}

1 \leq A < B \leq N

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

Print the smallest number of rounds after which the friends can get to play a match against each other.

Sample Input 1

5 2 4

Sample Output 1

1

If 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.

Sample Input 2

5 2 3

Sample Output 2

2

If both friends win two matches in a row, they will both move to table 1.

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <bits/stdc++.h>                                                                                                                                                                                                 //kek

#pragma GCC optimize("Ofast")

using namespace std;

typedef long long ll;
typedef long double ld;

#ifndef LOCAL
#define int long long
#endif

mt19937 rnd(time(0));
#define ioss ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("dead", "r", stdin); freopen("tmp.out", "w", stdout);
//#define _GLIBCXX_DEBUG
#define s second
#define f first
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pii pair<int,int>
#define res resize
#define PI acos(-1)

template<class T>
ll upmax(T &a, T b) { return (b > a) ? a = b, 1 : 0; }

template<class T>
ll upmin(T &a, T b) { return (b < a) ? a = b, 1 : 0; }

const ll INF = 1e9;//9223372036854775807L; //LONG_MAX;
constexpr ll mod = 1e9 + 7, dopmod = 6914882281337;

ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}

ll binpow(ll a, ll n) {
    if (n == 0)
        return 1;
    if (n % 2 == 1)
        return (binpow(a, n - 1) % mod) * a % mod;
    else {
        ll b = binpow(a, n / 2) % mod;
        return b * b % mod;
    }
}

ll calc(ll a, ll b, ll dd, ll n) {
    ll ass = INF;
    if (a == b)return dd;
    if ((b - a) % 2 == 0) {
        upmin(ass, (b - a) / 2);
    }
    upmin(ass, b - 1);
    upmin(ass, n - a);
    return ass + dd;
}

void solve() {
    ll n, a, b;
    cin >> n >> a >> b;
    if (a > b)swap(a, b);
    ll ans = INF;
    upmin(ans, calc(a, b, 0, n));
    //cout << ans << '\n';
    if (a != n && b == n)
        upmin(ans, calc(a + 1, b, 1, n));
    //cout << ans << '\n';
    if (b != 1 && a == 1)
        upmin(ans, calc(a, b - 1, 1, n));
    //cout << ans << '\n';
    if (a != n && b != 1)
        upmin(ans, calc(a + 1, b - 1, 1, n));
    cout << ans << '\n';
}

signed main() {
    //ioss
    //file
    int t = 1;                                                                                                                                                                        //ll
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}