





'''simple docstring'''




from itertools import permutations
def 	UpperCAmelCase_							(					__lowercase							:      tuple       )		->       bool:


     '''simple docstring'''



     if num[3] % 2 != 0:
          return False

     if (num[2] + num[3] + num[4]) % 3 != 0:
          return False

     if num[5] % 5 != 0:
          return False

     _UpperCAmelCase     							=   [7, 11, 13, 17]
     for i, test in enumerate(__lowercase       ):
          if (num[i + 4] * 100 + num[i + 5] * 10 + num[i + 6]) % test != 0:
               return False
     return True
def 	UpperCAmelCase_							(					__lowercase							:      int = 10       )		->       int:


     '''simple docstring'''



     return sum(
         int("".join(map(__lowercase			,     __lowercase       )       )       )
         for num in permutations(range(__lowercase       )       )
         if is_substring_divisible(__lowercase       )       )


if __name__ == "__main__":
  print(F"{solution() = }")











'''simple docstring'''




def 	UpperCAmelCase_							(					__lowercase							:      str       )		->       list:


     '''simple docstring'''



     if n_term == "":
          return []
     _UpperCAmelCase     							=   []
     for temp in range(int(__lowercase       )       ):
          series.append(f'1/{temp + 1}' if series else "1"       )
     return series


if __name__ == "__main__":
  __SCREAMING_SNAKE_CASE     :str       =				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))




