




'''simple docstring'''



def   lowercase__(			__UpperCamelCase:					list[int]      ,__UpperCamelCase:					str    ):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      List[str]    					=						int(__UpperCamelCase    )

      # Initialize Result
      SCREAMING_SNAKE_CASE   :      Optional[int]    					=						[]

      # Traverse through all denomination
      for denomination in reversed(__UpperCamelCase    ):
            # Find denominations
            while int(__UpperCamelCase    ) >= int(__UpperCamelCase    ):
                  total_value -= int(__UpperCamelCase    )
                  answer.append(__UpperCamelCase    )  # Append the "answers" array

      return answer


# Driver Code
if __name__ == "__main__":
      UpperCamelCase_    	=				[]
      UpperCamelCase_    	=				"0"

      if (
          input("Do you want to enter your denominations ? (yY/n): ").strip().lower()
          == "y"
      ):
            UpperCamelCase_    	=				int(input("Enter the number of denominations you want to add: ").strip())

            for i in range(0, n):
                  denominations.append(int(input(F"""Denomination {i}: """).strip()))
            UpperCamelCase_    	=				input("Enter the change you want to make in Indian Currency: ").strip()
      else:
            # All denominations of Indian Currency if user does not enter
            UpperCamelCase_    	=				[1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 5_0_0, 2_0_0_0]
            UpperCamelCase_    	=				input("Enter the change you want to make: ").strip()

      if int(value) == 0 or int(value) < 0:
            print("The total value cannot be zero or negative.")

      else:
            print(F"""Following is minimal change for {value}: """)
            UpperCamelCase_    	=				find_minimum_change(denominations, value)
            # Print result
            for i in range(len(answer)):
                  print(answer[i], end=" ")








'''simple docstring'''



def   lowercase__(			__UpperCamelCase:					int = 1_00_00_00    ):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      Tuple    					=						[i - 1 for i in range(limit + 1    )]

      for i in range(2      ,limit + 1    ):
            if phi[i] == i - 1:
                  for j in range(2 * i      ,limit + 1      ,__UpperCamelCase    ):
                        phi[j] -= phi[j] // i

      return sum(phi[2 : limit + 1]    )


if __name__ == "__main__":
      print(solution())


