{"problem":{"name":"Balanced Neighbors","description":{"content":"You are given an integer $N$. Build an undirected graph with $N$ vertices with indices $1$ to $N$ that satisfies the following two conditions: *   The graph is simple and connected. *   There exists ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc032_b"},"statements":[{"statement_type":"Markdown","content":"You are given an integer $N$. Build an undirected graph with $N$ vertices with indices $1$ to $N$ that satisfies the following two conditions:\n\n*   The graph is simple and connected.\n*   There exists an integer $S$ such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is $S$.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\n## Constraints\n\n*   All values in input are integers.\n*   $3 \\leq N \\leq 100$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc032_b","tags":[],"sample_group":[["3","2\n1 3\n2 3\n\n*   For every vertex, the sum of the indices of the vertices adjacent to that vertex is $3$."]],"created_at":"2026-03-03 11:01:14"}}