





def    __UpperCAmelCase(      lowercase_      ):
       _lowerCamelCase							:     str	=		int(lowercase_      )
       if n_element < 1:
              _lowerCamelCase							:     str	=		ValueError('''a should be a positive number'''      )
              raise my_error

       _lowerCamelCase							:     Union[str, Any]	=		[1]
       _lowerCamelCase,  _lowerCamelCase,  _lowerCamelCase							:     str	=		(0, 0, 0)
       _lowerCamelCase							:     Dict	=		1
       while index < n_element:
              while hamming_list[i] * 2 <= hamming_list[-1]:
                     i += 1
              while hamming_list[j] * 3 <= hamming_list[-1]:
                     j += 1
              while hamming_list[k] * 5 <= hamming_list[-1]:
                     k += 1
              hamming_list.append(
                  min(hamming_list[i] * 2 ,    hamming_list[j] * 3 ,    hamming_list[k] * 5      )      )
              index += 1
       return hamming_list


if __name__ == "__main__":
       _lowerCamelCase			       =      input('Enter the last number (nth term) of the Hamming Number Series: ')
       print('Formula of Hamming Number Series => 2^i * 3^j * 5^k')
       _lowerCamelCase			       =      hamming(int(n))
       print('-----------------------------------------------------')
       print(F'''The list with nth numbers is: {hamming_numbers}''')
       print('-----------------------------------------------------')








def    __UpperCAmelCase(      lowercase_ = 10_00      ):
       _lowerCamelCase							:     Optional[int]	=		2**power
       _lowerCamelCase							:     Optional[int]	=		0
       while n:
              _lowerCamelCase,  _lowerCamelCase							:     Optional[Any]	=		r + n % 10, n // 10
       return r


if __name__ == "__main__":
       print(solution(int(str(input()).strip())))

