import java.lang.String;
 
   public class StringCount2
 {
   public static void main(String args[])
   {
    String searchFor = "is";
    String base = "This is object oriented programming language  ";
    int len = searchFor.length();
    //System.out.println( "length of object =" +len);
    int result = 0;
    if (len > 0) 
    { 
     int start = base.indexOf(searchFor); 
    // System.out.println("index of object =" + start);
     while (start != -1) 
    {
     result++;
     start = base.indexOf(searchFor, start+len);
 
    }
    }
     System.out.println(result);
    }
 }

 public class StringCount2
 {
   public static void main(String args[])
   {
        String searchFor = "is";
        String base = "This is object oriented programming language.is is my favourite.";
        int len = searchFor.length();
        int result = 0;
        if (len > 0) 
        { 
             int start = base.indexOf(searchFor);
             while (start != -1)
             {
                int a=(int)(base.charAt(start-1));//Gives the ASCII equivalent of the character before the search String.
                int b=(int)(base.charAt(start+searchFor.length()));//Gives the ASCII equivalent of the character after the search String.
                //Check if the Character before or after (or both) the search String(*searchFor) is an Alphabet or not.
                if(((a>=65 && a<=90) || (a>=97 && a<=122)) || ((b>=65 && b<=90) || (b>=97 && b>=122)))
                {
                    //Not to be incremented as string searchFor is a part of a base.
                }
                else
                    result++;//Update the result.
                start = base.indexOf(searchFor, (start+len));
             }
         }
        System.out.println(result);
    }
 }