#include<iostream>
using namespace std;
int n[11] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
int main(){
    int a, b, tmp, max = -100000, ans;
    cin >> a >> b;
    for(int i = a; i <= b; i++){
        tmp = i;
        while(tmp > 0){
            n[tmp % 10]++;
            tmp /= 10;
        }
    }
    for(int i = 0; i <= 9; i++){
        if(n[i] > max){
            max = n[i];
            ans = i;
        }
    }
    cout << ans;
    return 0;
}

#include<iostream>
#include<algorithm> 
using namespace std;
int a[20000],b[20000],a1=1;
int main()
{
    int x,y,z;
    cin>>x>>y;
    for(int i=x;i<=y;i++)
    {
        int z=i;
        while(z!=0)
        {
            for(int j=0;j<10;j++)
            if(j==z%10)
            a[j]++;
            z/=10;
        }
    }
    int m=a[0],s=m;
    for(int j=0;j<10;j++)
    if(a[j]>m)
    {
        m=a[j];
        s=j;
    }
    cout<<s;
}