Positive integers 1,2,3,...,n are written on a blackboard (n>2). Every minute two numbers are erased and the least prime divisor of their sum is written. In the end only the number 97 remains. Find the least n for which it is possible. number theorycombinatorics