Complicated Swaps
N students are sitting around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in minutes) required for all students to sit in reverse order
(the left neighbors become right, and right become left).
(the left neighbors become right, and right become left).
InputThe input will contain one integer N (1 <= N <= 100000).
OutputPrint the minimum time required for all the students to sit in reverse order.
Input:
4Output:2Input:
6Output:6Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.