Problem description
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose exactly one element from the array and replace it with another integer that also lies in the range from 1 to 109, inclusive. It is not allowed to replace a number with itself or to change no number at all.
After the replacement Petya sorted the array by the numbers' non-decreasing. Now he wants to know for each position: what minimum number could occupy it after the replacement and the sorting.
Input
The first line contains a single integer n (1 ≤ n ≤ 105), which represents how many numbers the array has. The next line contains n space-separated integers — the array's description. All elements of the array lie in the range from 1 to 109, inclusive.
Output
Print n space-separated integers — the minimum possible values of each array element after one replacement and the sorting are performed.
Examples
Input
5
1 2 3 4 5
Output
1 1 2 3 4
Input
5
2 3 4 5 6
Output
1 2 3 4 5
Input
3
2 2 2
Output
1 2 2
解题思路：题目的意思就是将n个数中的最大值替换成最小值（1-10^9），要求不能替换成本身并且必须用一个（相对）最小值替换此最大值。因此，如果最大值为1，则替换的最小值为2；如果最大值大于1，则替换的最小值为1，水过！
AC代码：
1 #include<bits/stdc++.h> 2 using namespace std; 3 const int maxn=1e5+5; 4 int n,a[maxn]; 5 int main(){ 6 cin>>n; 7 for(int i=0;i<n;++i)cin>>a[i]; 8 sort(a,a+n); 9 a[n-1]=a[n-1]>1?1:2; 10 sort(a,a+n); 11 for(int i=0;i<n;++i) 12 cout<<a[i]<<(i==n-1?" ":" "); 13 return 0; 14 }