//串T中是否含有串P
 public class Pattern { public static void main(String args[]){
   
   
   char [] T={'D','T','U','O','P'};
   char [] P={'U','O'};
   int k=0,j=0;
   while(k<T.length&&j<P.length){
    if(T[k]==P[j])
    {k++;j++;}
    else{
    k=k-j+1;j=0;
    }
    
   }
   if(j==P.length)System.out.print(k-P.length);
   else System.out.print(0);
   
  
  }
  
  
 }