|Codeforces Round #690 (Div. 3)|
Polycarp has a string $$$s[1 \dots n]$$$ of length $$$n$$$ consisting of decimal digits. Polycarp performs the following operation with the string $$$s$$$ no more than once (i.e. he can perform operation $$$0$$$ or $$$1$$$ time):
For example, the string $$$s = $$$"20192020" Polycarp can turn into strings:
Polycarp likes the string "2020" very much, so he is wondering if it is possible to turn the string $$$s$$$ into a string "2020" in no more than one operation? Note that you can perform zero operations.
The first line contains a positive integer $$$t$$$ ($$$1 \leq t \leq 1000 $$$) — number of test cases in the test. Then $$$t$$$ test cases follow.
The first line of each test case contains an integer $$$n$$$ ($$$4 \leq n \leq 200$$$) — length of the string $$$s$$$. The next line contains a string $$$s$$$ of length $$$n$$$ consisting of decimal digits. It is allowed that the string $$$s$$$ starts with digit 0.
For each test case, output on a separate line:
You may print every letter of "YES" and "NO" in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
6 8 20192020 8 22019020 4 2020 5 20002 6 729040 6 200200
YES YES YES NO NO NO
In the first test case, Polycarp could choose $$$i=3$$$ and $$$j=6$$$.
In the second test case, Polycarp could choose $$$i=2$$$ and $$$j=5$$$.
In the third test case, Polycarp did not perform any operations with the string.