Replace Every x by y and Count Replacements

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given $A=(a_0,\ldots,a_{n-1})$ and integers $x,y$, assign $a_i\leftarrow y$ for every index whose original value equals $x$. Also compute $c=|\{i:a_i^{old}=x\}|$. If $x=y$, the array is unchanged but each matching position still counts as an activated replacement.

Input

Read $n$, then the array, then $x,y$.

Output

Print $c$, then the modified array.

Subtask

Subtask 1 (20 points): $1\le n\le10$.

Subtask 2 (30 points): $1\le n\le1000$.

Subtask 3 (50 points): $1\le n\le10^5$, values within $10^9$ in magnitude.

Example

Input

6
2 5 2 7 2 9
2 8

Output

3
8 5 8 7 8 9

Explanation

Value 2 occurs three times, so three positions become 8.