#include<algorithm>
#include<cassert>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

int main(){
  string s;cin>>s;
  string t=s;
  sort(t.begin(),t.end());
  t.erase(unique(t.begin(),t.end()),t.end());
  for(char c:t){
    int a=0;
    int idx=-1;
    rep(i,s.size())if(s[i]==c)a++,idx=i+1;
    if(a==1){
      cout<<idx<<" "<<c<<endl;
      return 0;
    }
  }
}