tim-one

import sys

N = 808017424794512875886459904961710757005754368000000000

def fac(n):
    for div in range(2, 1000):
        if not n % div:
            count = 1
            n //= div
            while n > 1:

tim-one

import sys

if 1:
    import psutil
    from collections import deque
    import gc

    def fint(i):
        return format(i, '_')

tim-one

from bisect import bisect_right
from collections.abc import Sequence
from itertools import chain, islice, pairwise, repeat
import operator
import random
import secrets

seed = secrets.token_bytes(16)
#seed = b'N\x1b\xac(\xdf\x0e\xbbj\xfe\xccM\xaf\xb7{e\x91'
print("seed", seed)