#include <bits/stdc++.h> using namespace std; int n,ansi,ansj; void dfs(int x,int len,int fir) { if(ansi==x) { cout<<fir+ansj-x<<endl; exit(0); } fir=fir+len-1; if(ansj==n-x+1) { cout<<fir+ansi-x<<endl; exit(0); } fir=fir+len-1; fir=fir+len-1; if(ansi==n-x+1) { cout<<fir-(ansj-x)<<endl; exit(0); } fir=fir+len-1; if(ansj==x) { cout<<fir-(ansi-x)<<endl; exit(0); } dfs(x+1,len-2,fir); } int main() { scanf("%d%d%d",&n,&ansi,&ansj); dfs(1,n,1); return 0; }