


def 		_A		(		_lowercase = 1_00_00_00 )					-> int:


     """simple docstring"""


     __UpperCamelCase =			set(range(3					,  _lowercase					,  2 ) )
     primes.add(2 )
     for p in range(3					,  _lowercase					,  2 ):
          if p not in primes:
               continue
          primes.difference_update(set(range(p * p					,  _lowercase					,  _lowercase ) ) )

     __UpperCamelCase =			[float(_lowercase ) for n in range(limit + 1 )]

     for p in primes:
          for n in range(_lowercase					,  limit + 1					,  _lowercase ):
               phi[n] *= 1 - 1 / p

     return int(sum(phi[2:] ) )


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






def 		_A		(		_lowercase )					-> int:


     """simple docstring"""


     assert column_title.isupper()
     __UpperCamelCase =			0
     __UpperCamelCase =			len(_lowercase ) - 1
     __UpperCamelCase =			0

     while index >= 0:
          __UpperCamelCase =			(ord(column_title[index] ) - 64) * pow(26					,  _lowercase )
          answer += value
          power += 1
          index -= 1

     return answer


if __name__ == "__main__":
    from doctest import testmod

    testmod()


