A class consists of 26 students with two students sitting on each desk. Suddenly, the students decide to change seats, such that every two students that were previously sitting together are now apart. Find the maximum value of positive integer $N$ such that, regardless of the students' sitting positions, at the end there is a set $S$ consisting of $N$ students satisfying the following property: every two of them have never been sitting together.