#include <iostream>
#include <deque>
#include <string>
#include <algorithm>

#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long llint;

char a[20];
deque< int > dq;

int main(){
  bool ok;
  for( int i=0; i<5; i++ ){
    scanf( "%s", a );
    ok=0;
    for( int j=0; j<strlen( a )-2; j++ )
      if( a[j] == 'F' and a[j+1] == 'B' and a[j+2] == 'I' ){
        ok = 1;
        dq.push_back( i+1 );
        break;
      }
  }
  if( dq.size() )
    for( int i=0; i<dq.size(); i++ )
      if( i+1 != dq.size() ) printf( "%d ", dq[i] );
      else printf ( "%d\n", dq[i] );
  else printf( "UTEKO\n" );
  return 0;
}