"""simple docstring"""



from __future__ import annotations



def      _lowerCamelCase(     a					,  a							):
       __a	      =  get_failure_array(lowerCAmelCase__							)

       # 2) Step through text searching for pattern
       __a      ,					__a	      =  0, 0  # index into text, pattern
       while i < len(lowerCAmelCase__							):
              if pattern[j] == text[i]:
                     if j == (len(lowerCAmelCase__							) - 1):
                            return True
                     j += 1

              # if this is a prefix in our pattern
              # just go back far enough to continue
              elif j > 0:
                     __a	      =  failure[j - 1]
                     continue
              i += 1
       return False



def      _lowerCamelCase(     a							):
       __a	      =  [0]
       __a	      =  0
       __a	      =  1
       while j < len(lowerCAmelCase__							):
              if pattern[i] == pattern[j]:
                     i += 1
              elif i > 0:
                     __a	      =  failure[i - 1]
                     continue
              j += 1
              failure.append(lowerCAmelCase__							)
       return failure


if __name__ == "__main__":
   # Test 1)
   SCREAMING_SNAKE_CASE__:Optional[int]		       =       """abc1abc12"""
   SCREAMING_SNAKE_CASE__:Union[str, Any]		       =       """alskfjaldsabc1abc1abc12k23adsfabcabc"""
   SCREAMING_SNAKE_CASE__:int		       =       """alskfjaldsk23adsfabcabc"""
   assert kmp(pattern, texta) and not kmp(pattern, texta)

   # Test 2)
   SCREAMING_SNAKE_CASE__:Any		       =       """ABABX"""
   SCREAMING_SNAKE_CASE__:Any		       =       """ABABZABABYABABX"""
   assert kmp(pattern, text)

   # Test 3)
   SCREAMING_SNAKE_CASE__:Optional[int]		       =       """AAAB"""
   SCREAMING_SNAKE_CASE__:Tuple		       =       """ABAAAAAB"""
   assert kmp(pattern, text)

   # Test 4)
   SCREAMING_SNAKE_CASE__:Optional[int]		       =       """abcdabcy"""
   SCREAMING_SNAKE_CASE__:Dict		       =       """abcxabcdabxabcdabcdabcy"""
   assert kmp(pattern, text)

   # Test 5)
   SCREAMING_SNAKE_CASE__:Optional[Any]		       =       """aabaabaaa"""
   assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]




"""simple docstring"""




def        lowercase							(		lowerCAmelCase__ :     str			) ->      list:
		if n_term == "":
				return []
		__a           =			[]
		for temp in range(int(lowerCAmelCase__			)			):
				series.append(f'''1/{temp + 1}''' if series else '''1'''			)
		return series


if __name__ == "__main__":
				lowercase_			     =  input("Enter the last number (nth term) of the Harmonic Series")
				print("Formula of Harmonic Series => 1+1/2+1/3 ..... 1/n")
				print(harmonic_series(nth_term))






