F

# F

def isPrime(n):
    flag = True
    for i in range(2, n):
        if n % i == 0:
            flag = False
    return flag


c = input()
while c != '':
    prevPrime = 0
    nextPrime = 0
    n = int(c)
    for i in range(n - 1, 1, -1):
        if isPrime(i):
            prevPrime = i
            break
    j = n + 1
    while True:
        if isPrime(j):
            nextPrime = j
            break
        j += 1
    print('%d<%d<%d' %(prevPrime, n, nextPrime))
    c = input()