#include "bits/stdc++.h"
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>;  using Vi = vector<long long int>;
using P = pair<int, int>;  using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define rep(i,N) for(ll i = 0; i < (ll)N; i++)
#define repi(i,a,b) for(ll i = ll(a); i < ll(b); ++i)
template<class T>bool chmax(T &former, const T &b) { if (former<b) { former=b; return true; } return false; }
template<class T>bool chmin(T &former, const T &b) { if (b<former) { former=b; return true; } return false; }
template<class T>T sqar(T x){ return x*x; }//sqrt(x)は平方根;
#define Sort(v) std::sort(v.begin(), v.end(), std::greater<decltype(v[0])>()) //降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v> >
template<class T> inline void princ(T x){cout<<x<<" ";}; 
template<class T> inline void print(T x){cout<<x<<"\n";};
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
///////////////////////////////////////////////////////////////////////////////////

string s;

int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    std::cout<<std::fixed<<std::setprecision(30);
    cin>>s;
    ll aa = -1,bb = -1;
    rep(i,s.size()){
        if(i-1>=0){
            if(s[i]==s[i-1]){
                aa = i;
                bb = i+1;
                break;
            }
        }
        if(i-2>=0){
            if(s[i-2]==s[i]){
                aa = i-1;
                bb = i+1;
                break;
            }
        }
    }
    cout<<aa<<" "<<bb<<endl;
    return 0;
}
#include <bits/stdc++.h>
using namespace std;

int main() {
  string S;
  cin >> S;
  int res = 100000;
  for (int i = 0; i + 2 < S.size(); ++i) {
    int val = (S[i]-'0')*100 + (S[i+1]-'0')*10 + (S[i+2]-'0');
    res = min(res, abs(val - 753));
  }
  cout << res << endl;
}