ZS the Coder and Chris the Baboon are travelling to Udayland! To get there, they have to get on the special IOI bus. The IOI bus has _n_ rows of seats. There are 4 seats in each row, and the seats are separated into pairs by a walkway. When ZS and Chris came, some places in the bus was already occupied.
ZS and Chris are good friends. They insist to get **a pair of neighbouring empty seats**. Two seats are considered neighbouring if they are in the same row and in the same pair. Given the configuration of the bus, can you help ZS and Chris determine where they should sit?
## Input
The first line of the input contains a single integer _n_ (1 ≤ _n_ ≤ 1000) — the number of rows of seats in the bus.
Then, _n_ lines follow. Each line contains exactly 5 characters, the first two of them denote the first pair of seats in the row, the third character denotes the walkway (it always equals '|') and the last two of them denote the second pair of seats in the row.
Each character, except the walkway, equals to 'O' or to 'X'. 'O' denotes an empty seat, 'X' denotes an occupied seat. See the sample cases for more details.
## Output
If it is possible for Chris and ZS to sit at neighbouring empty seats, print "YES" (without quotes) in the first line. In the next _n_ lines print the bus configuration, where the characters in the pair of seats for Chris and ZS is changed with characters '+'. Thus the configuration should differ from the input one by exactly two charaters (they should be equal to 'O' in the input and to '+' in the output).
If there is no pair of seats for Chris and ZS, print "NO" (without quotes) in a single line.
If there are multiple solutions, you may print any of them.
[samples]
## Note
Note that the following is an incorrect configuration for the first sample case because the seats must be in the same pair.
_O+|+X_
_XO|XX_
_OX|OO_
_XX|OX_
_OO|OO_
_OO|XX_
ZS the Coder 和 Chris the Baboon 正在前往 Udayland！为了到达那里，他们必须乘坐特殊的 IOI 公交车。这辆 IOI 公交车有 #cf_span[n] 排座位。每排有 #cf_span[4] 个座位，座位被过道分成若干对。当 ZS 和 Chris 到达时，公交车上的一些座位已经被占用。
ZS 和 Chris 是好朋友，他们坚持要坐 *一对相邻的空座位*。如果两个座位在同一排且属于同一对，则认为它们是相邻的。给定公交车的布局，你能帮助 ZS 和 Chris 确定他们应该坐在哪里吗？
输入的第一行包含一个整数 #cf_span[n] #cf_span[(1 ≤ n ≤ 1000)] —— 公交车的座位排数。
接下来有 #cf_span[n] 行。每行恰好包含 #cf_span[5] 个字符，前两个字符表示该排的第一个座位对，第三个字符表示过道（始终为 '|'），最后两个字符表示该排的第二个座位对。
除过道字符外，每个字符均为 'O' 或 'X'。'O' 表示空座位，'X' 表示已占用的座位。详见样例。
如果 Chris 和 ZS 可以坐在一对相邻的空座位上，则在第一行输出 "YES"（不含引号）。接下来的 #cf_span[n] 行输出修改后的公交车布局，其中 Chris 和 ZS 所坐的那一对座位中的字符改为 '+'。因此，输出布局应与输入布局恰好有两个字符不同（这两个字符在输入中为 'O'，在输出中为 '+'）。
如果不存在这样的一对座位，则在单独一行输出 "NO"（不含引号）。
如果有多个解，你可以输出其中任意一个。
注意：以下配置是第一个样例的错误答案，因为座位必须属于同一对：
_O+|+X_
_XO|XX_
_OX|OO_
_XX|OX_
_OO|OO_
_OO|XX_
## Input
输入的第一行包含一个整数 #cf_span[n] #cf_span[(1 ≤ n ≤ 1000)] —— 公交车的座位排数。接下来有 #cf_span[n] 行。每行恰好包含 #cf_span[5] 个字符，前两个字符表示该排的第一个座位对，第三个字符表示过道（始终为 '|'），最后两个字符表示该排的第二个座位对。除过道字符外，每个字符均为 'O' 或 'X'。'O' 表示空座位，'X' 表示已占用的座位。详见样例。
## Output
如果 Chris 和 ZS 可以坐在一对相邻的空座位上，则在第一行输出 "YES"（不含引号）。接下来的 #cf_span[n] 行输出修改后的公交车布局，其中 Chris 和 ZS 所坐的那一对座位中的字符改为 '+'。因此，输出布局应与输入布局恰好有两个字符不同（这两个字符在输入中为 'O'，在输出中为 '+'）。如果不存在这样的一对座位，则在单独一行输出 "NO"（不含引号）。如果有多个解，你可以输出其中任意一个。
[samples]
## Note
注意：以下配置是第一个样例的错误答案，因为座位必须属于同一对：
_O+|+X_
_XO|XX_
_OX|OO_
_XX|OX_
_OO|OO_
_OO|XX_
**Definitions**
Let $ n \in \mathbb{Z} $ be the number of rows, with $ 1 \leq n \leq 1000 $.
For each row $ i \in \{1, \dots, n\} $, let $ R_i \in \{O, X, |\}^5 $ be a string representing the seat configuration, where:
- Positions $ R_i[0], R_i[1] $ form the left pair of seats,
- $ R_i[2] = | $ (fixed walkway),
- $ R_i[3], R_i[4] $ form the right pair of seats.
Each seat is either empty ('O') or occupied ('X').
**Constraints**
1. $ 1 \leq n \leq 1000 $
2. For all $ i \in \{1, \dots, n\} $, $ R_i[2] = | $
3. For all $ i \in \{1, \dots, n\} $ and $ j \in \{0,1,3,4\} $, $ R_i[j] \in \{O, X\} $
**Objective**
Determine if there exists at least one row $ i $ and one pair (left: $ \{0,1\} $ or right: $ \{3,4\} $) such that both seats in the pair are empty (i.e., $ R_i[j] = R_i[k] = O $ for $ (j,k) \in \{(0,1), (3,4)\} $).
- If such a pair exists:
- Output "YES".
- Modify one such pair in the bus configuration by changing both 'O's to '+' and output the modified configuration.
- Otherwise, output "NO".
(Any valid solution is acceptable.)