Codeforces 944B Laboratory Work

传送门：Codeforces 944B

B. Laboratory Work

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Anya and Kirill are doing a physics laboratory work. In one of the tasks they have to measure some value n times, and then compute the average value to lower the error.

Kirill has already made his measurements, and has got the following integer values: x1, x2, ..., xn. It is important that the values are close to each other, namely, the difference between the maximum value and the minimum value is at most 2.

Anya does not want to make the measurements, however, she can't just copy the values from Kirill's work, because the error of each measurement is a random value, and this coincidence will be noted by the teacher. Anya wants to write such integer values y1, y2, ..., yn in her work, that the following conditions are met:

• the average value of x1, x2, ..., xn is equal to the average value of y1, y2, ..., yn;
• all Anya's measurements are in the same bounds as all Kirill's measurements, that is, the maximum value among Anya's values is not greater than the maximum value among Kirill's values, and the minimum value among Anya's values is not less than the minimum value among Kirill's values;
• the number of equal measurements in Anya's work and Kirill's work is as small as possible among options with the previous conditions met. Formally, the teacher goes through all Anya's values one by one, if there is equal value in Kirill's work and it is not strike off yet, he strikes off this Anya's value and one of equal values in Kirill's work. The number of equal measurements is then the total number of strike off values in Anya's work.

Help Anya to write such a set of measurements that the conditions above are met.

Input

The first line contains a single integer n (1 ≤ n ≤ 100 000) — the numeber of measurements made by Kirill.

The second line contains a sequence of integers x1, x2, ..., xn ( - 100 000 ≤ xi ≤ 100 000) — the measurements made by Kirill. It is guaranteed that the difference between the maximum and minimum values among values x1, x2, ..., xn does not exceed 2.

Output

In the first line print the minimum possible number of equal measurements.

In the second line print n integers y1, y2, ..., yn — the values Anya should write. You can print the integers in arbitrary order. Keep in mind that the minimum value among Anya's values should be not less that the minimum among Kirill's values, and the maximum among Anya's values should be not greater than the maximum among Kirill's values.

If there are multiple answers, print any of them.

Examples

input

Copy

6
-1 1 1 0 0 -1

output

2
0 0 0 0 0 0 

input

Copy

3
100 100 101

output

3
101 100 100 

input

Copy

7
-10 -9 -10 -8 -10 -9 -9

output

5
-10 -10 -9 -9 -9 -9 -9 

Note

In the first example Anya can write zeros as here measurements results. The average value is then equal to the average value of Kirill's values, and there are only two equal measurements.

In the second example Anya should write two values 100 and one value 101 (in any order), because it is the only possibility to make the average be the equal to the average of Kirill's values. Thus, all three measurements are equal.

In the third example the number of equal measurements is 5.

分析：数字的范围控制在2内，构造时候枚举最小数字的个数

加几个剪枝，减去不合条件的枚举

具体实现见代码

代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int INF = 1<<30;
const int maxn = 100000+5;
int w[3];
int a[maxn];
int n,mn,sum;

int main(){
    scanf("%d",&n);
    mn = INF; sum = 0;
    memset(w,0,sizeof(w));
    for (int i=1; i<=n; i++) scanf("%d",&a[i]),mn = min(mn,a[i]);
    for (int i=1; i<=n; i++) {
        a[i] = a[i]-(mn+1);
        sum += a[i];
        w[a[i]+1]++;
    }

    int ans = INF;
    int v1,v2,v3;
    for (int i=0; i<=n; i++) {
        int tmp = sum+i;
        if (tmp<0) continue;
        if (tmp>0 && !w[2]) continue;
        if (n-tmp-i<0) continue;
        if (n-tmp-i>0 && !(w[1] || w[2])) continue;
        int tot = min(i,w[0])+min(n-tmp-i,w[1])+min(tmp,w[2]);
        if (tot<ans) {
            ans = tot;
            v1 = i;
            v2 = n-tmp-i;
            v3 = tmp;
        }
    }

    printf("%d\n",ans);
    for (int i=1; i<=v1; i++) printf("%d ",mn);
    for (int i=1; i<=v2; i++) printf("%d ",mn+1);
    for (int i=1; i<=v3; i++) printf("%d ",mn+2);
    return 0;
}