#include <iostream>
#include <cassert>
using namespace std;
using ll = long long;
#define MAIN main
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define TYPE_OF( VAR ) decay_t<decltype( VAR )>
#define CEXPR( LL , BOUND , VALUE ) constexpr LL BOUND = VALUE
#define CIN( LL , A ) LL A; cin >> A 
#define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX ) 
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX ) 
#define FOREQINV( VAR , INITIAL , FINAL ) for( TYPE_OF( INITIAL ) VAR = INITIAL ; VAR >= FINAL ; VAR -- ) 
#define QUIT return 0 
#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; QUIT 

ll HereditaryNotation( const string& s , const int& l , int r , ll& bound )
{
  CEXPR( char , R , ')' );
  ll answer = 0;
  bool found;
  while( l < r ){
    if( bound <= 0 ){
      return -1;
    }
    found = false;
    if( s[r-1] == R ){
      int layer = 1;
      FOREQINV( m , r - 2 , l ){
	if( s[m] == R ){
	  layer++;
	} else {
	  layer--;
	}
	if( layer == 0 ){
	  ll exponent = 0;
	  ll power = 1;
	  while( power <= bound ){
	    power *= 2;
	    exponent++;
	  }
	  exponent--;
	  if( ( exponent = HereditaryNotation( s , m + 1 , r - 1 , exponent ) ) == -1 ){
	    return -1;
	  }
	  ( power = 1 ) <<= exponent;
	  r = m;
	  answer += power;
	  bound -= power;
	  found = true;
	  break;
	}
      }
    }
    if( ! found ){
      return answer + 1;
    }
  }
  return answer;
}

int MAIN()
{
  UNTIE;
  CEXPR( int , bound_L , 100000 );
  CIN( string , S );
  int L = S.size();
  ASSERT( L , 1 , bound_L );
  ll bound = 1000000000000000000;
  ll answer = HereditaryNotation( S , 0 , L , bound );
  if( answer == -1 ){
    RETURN( "INFTY" );
  }
  RETURN( answer );
}