




def 				lowerCAmelCase_	(     snake_case_,snake_case_,snake_case_,snake_case_,snake_case_,snake_case_     ):
      if index == r:
            for j in range(snake_case_     ):
                  print(data[j],end=""" """     )
            print(""" """     )
            return
      #  When no more elements are there to put in data[]
      if i >= n:
            return
      # current is included, put next at next location
      _A							:     Tuple			=						arr[i]
      combination_util(snake_case_,snake_case_,snake_case_,index + 1,snake_case_,i + 1     )
      # current is excluded, replace it with
      # next (Note that i+1 is passed, but
      # index is not changed)
      combination_util(snake_case_,snake_case_,snake_case_,snake_case_,snake_case_,i + 1     )
      # The main function that prints all combinations
      # of size r in arr[] of size n. This function
      # mainly uses combinationUtil()







def 				lowerCAmelCase_	(     snake_case_,snake_case_,snake_case_     ):
      # A temporary array to store all combination one by one
      _A							:     str			=						[0] * r
      # Print all combination using temporary array 'data[]'
      combination_util(snake_case_,snake_case_,snake_case_,0,snake_case_,0     )


if __name__ == "__main__":
  # Driver code to check the function above
  _snake_case										=       [10, 20, 30, 40, 50]
  print_combination(arr, len(arr), 3)
  # This code is contributed by Ambuj sahu







def 				lowerCAmelCase_	(     snake_case_     ):
      if n_term == "":
            return []
      _A							:     list			=						[]
      for temp in range(int(snake_case_     )     ):
            series.append(f'''1/{temp + 1}''' if series else """1"""     )
      return series


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

