{"problem":{"name":"Decrease (Judge ver.)","description":{"content":"We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller. ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc079_c"},"statements":[{"statement_type":"Markdown","content":"We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller. (The operation is the same as the one in Problem D.)\n\n*   Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by $N$, and increase each of the other elements by $1$.\n\nIt can be proved that the largest element in the sequence becomes $N-1$ or smaller after a finite number of operations.\nYou are given the sequence $a_i$. Find the number of times we will perform the above operation.\n\n## Constraints\n\n*   $2 ≤ N ≤ 50$\n*   $0 ≤ a_i ≤ 10^{16} + 1000$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$a_1$ $a_2$ ... $a_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc079_c","tags":[],"sample_group":[["4\n3 3 3 3","0"],["3\n1 0 3","1"],["2\n2 2","2"],["7\n27 0 0 0 0 0 0","3"],["10\n1000 193 256 777 0 1 1192 1234567891011 48 425","1234567894848"]],"created_at":"2026-03-03 11:01:14"}}