1
#include <algorithm>
2
#include <cstdio>
3
#include <cstring>
4
using namespace std;
5
int a[500005], b[500005];
6
int main()
7
{
8
    int n;
9
    scanf("%d", &n);
10
    for (int i = 1; i <= n; i++)
11
        scanf("%d", &a[i]);
12
    a[n+1]=a[n];
13
    int i = 1, l, r;
14
    int ans = 0;
15
    while (i <= n)
16
    {
17
        while (i <= n && a[i] == a[i + 1])
18
        {
19
            b[i] = a[i];
20
            i++;
21
        }
22
        l = i;
23
        while (i <= n && a[i] != a[i + 1])
24
            i++;
25
        r = i;
26
        int len = (r - l + 1);
27
        if (len & 1)
28
            for (int j = l; j <= r; j++)
29
                b[j] = a[l];
30
        else
31
            for (int j = 1; j * 2 <= len; j++)
32
                b[l + j - 1] = a[l], b[r - j + 1] = a[r];
33
        ans = max(ans, (len - 1) / 2);
34
    }
35
    printf("%d\n", ans);
36
    for (int i = 1; i <= n; i++)
37
        printf("%d ", b[i]);
38
    //while(1);
39
}