/*
TASK:notalike
LANG:C++
*/
#include<iostream>

using namespace std;

int notalike (int n, int p) 
{
    if (n<p) return 0;
    int booln[11]={0},boolp[11]={0},sizen,sizep,boolc[11]={0},br=0,j,i;
    i=10,j=10;
    while (n) {
          booln[i]=n%2;
          n/=2;
          i--;
          }
    while (p) {
          boolp[j]=p%2;
          p/=2;
          j--;
          }
    sizen=i;
    sizep=j;
    for (i=10;i>=sizen;i--)
        boolc[i]=booln[i]^boolp[i];
    for (i=0;i<11;i++) if (boolc[i]) br++;
    return br;        
}

int main()
{
    int n,p,q,min=100,imin;
    cin >> n >> p >> q;
    for ( int i=p;i<=q;i++) 
        if (notalike(n,i)<min) {
                               imin=i;
                               min=notalike(n,i);
                               }
    cout << imin << "\n";
    return 0;
}
