MaxPrime/abrivan
MaxPrime/Stephan
n1def prime(k):n1def prime(a):
2    for j in range(2, int(k**0.5)+1):2    for x in range(2, int(a**0.5)+1):
3        if k % j == 0:3        if a % x == 0:
4            return False4            return False
55
6    return True6    return True
77
88
n9num = int(input())n9n = int(input())
1010
n11while not prime(num):n11while not prime(n):
12    num -= 112    n -= 1
1313
t14print(num)t14print(n)
1515
Legends
Colors
 Added 
Changed
Deleted
Links
(f)irst change
(n)ext change
(t)op