Codeforces Round #369 (Div. 2) A. Bus to Udayland

A. Bus to Udayland

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 nrows 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.

Examples

input

6
OO|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX

output

YES
++|OX
XO|XX
OX|OO
XX|OX
OO|OO
OO|XX

input

4
XO|OX
XO|XX
OX|OX
XX|OX

output

NO

input

5
XX|XX
XX|XX
XO|OX
XO|OO
OX|XO

output

YES
XX|XX
XX|XX
XO|OX
XO|++
OX|XO

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

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
char seats[1010][10];
int main(){
	int n;
	scanf("%d",&n);
	int flag1=0,flag2=0;
	for(int i=2;i<=n+1;i++){
		scanf("%s",seats[i]);
		if(seats[i][0]=='O'&&seats[i][1]=='O'){
		
			flag1=i;
		}
		else if(seats[i][3]=='O'&&seats[i][4]=='O'){
		
			
			flag2=i;
		}
	
	}

	if(!flag1&&!flag2){
		printf("NO\n");
	}
	else{
		printf("YES\n");
		if(flag1){
			for(int i=2;i<=n+1;i++){
				if(i==flag1){
						seats[i][0]='+';seats[i][1]='+';
				}
				printf("%s\n",seats[i]);
			}	
		}
		else{
			for(int i=2;i<=n+1;i++){
				if(i==flag2){
					seats[i][3]='+';seats[i][4]='+';
				}
				printf("%s\n",seats[i]);
			}
		}
		
	}

}

题意：找到两个严格符合OO的位置，改成++；

思路：flag1用来标记左边为OO的情况，值代表最后一个左边OO所在行；flag2用来标记右边为OO的情况，值代表最后一个右边OO所在行；

判断flag1 flag2是否存在，flag1存在就把该行所在的左边换为++，右边同理；

注意flag1如果判断存在以后就不要修改flag2标记的行了；