N = 600851475143


def primes():
    sieve = [2, 3, 5, 7, 11]

    yield from sieve

    curr = sieve[-1]

    while True:
        for prime in sieve:
            if curr % prime == 0:
                break
        else:
            sieve.append(curr)
            yield curr

        curr += 1


def minmax_divider(number):
    for prime in primes():
        partity, remainder = divmod(number, prime)
        if remainder == 0:
            return prime, partity

        if prime * prime > number:
            break

    return 1, number


if __name__ == "__main__":
    print(minmax_divider(N))