output_description: If the number of non-negative integers i satisfying the following condition is
  finite, print the maximum value of such i; if the number is infinite, print
  `-1`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      s
      t
attempt: print(-1)
  
problem_description: Statement
  
  Given are two strings s and t consisting of lowercase English letters.
  Determine if the number of non-negative integers i satisfying the following
  condition is finite, and find the maximum value of such i if the number is
  finite.
  
    * There exists a non-negative integer j such that the concatenation of i copies of t is a substring of the concatenation of j copies of s.
samples: [{"input": "abcabab\n    ab", "output": "3\n    \n\nThe concatenation of three copies of t, `ababab`, is a substring of the\nconcatenation of two copies of s, `abcabababcabab`, so i = 3 satisfies the\ncondition.\n\nOn the other hand, the concatenation of four copies of t, `abababab`, is not a\nsubstring of the concatenation of any number of copies of s, so i = 4 does not\nsatisfy the condition.\n\nSimilarly, any integer greater than 4 does not satisfy the condition, either.\nThus, the number of non-negative integers i satisfying the condition is\nfinite, and the maximum value of such i is 3.\n\n* * *"}, {"input": "aa\n    aaaaaaa", "output": "-1\n    \n\nFor any non-negative integer i, the concatenation of i copies of t is a\nsubstring of the concatenation of 4i copies of s. Thus, there are infinitely\nmany non-negative integers i that satisfy the condition.\n\n* * *"}, {"input": "aba\n    baaab", "output": "0\n    \n\nAs stated in Notes, i = 0 always satisfies the condition."}]