Question 129
A class consists of 26 students, sitting in pairs. In the second term they decide to change positions so that every two students who sat together in the first term do not sit together in the second. Find the largest possible value of $N$ such that, no matter how the students sat in the two terms, there is a set $S$ of $N$ students no two of whom sat together in either of the two terms.