n numbers. She can choose any of the operating parameters. k, it cannot be changed. Then BaiQian can perform an unlimited number of operations . Each operation is to select the. n numbers and make them decrease by 1. She wants to make all the numbers equal.
BaiQian has n n numbers. She can choose any of the operating parameters k (1 leq k leq n) k(1≤k≤n). After selecting the value of k k, it cannot be changed. Then BaiQian can perform an unlimited number of operations (at least once). Each operation is to select the k k numbers with different positions from the n n numbers and make them decrease by 1. She wants to make all the numbers equal. How much k k can BaiQian choose? If there are multiple possible k k, please output the largest one.
（图片来源网络，侵删）
