Codeforces Round 111 (Div. 2)
B
Unlucky Ticket
Codeforces
1100
原题
← AC →
翻译中…

Each of you probably has your personal experience of riding public transportation and buying tickets. After a person buys a ticket (which traditionally has an even number of digits), he usually checks whether the ticket is lucky. Let us remind you that a ticket is lucky if the sum of digits in its first half matches the sum of digits in its second half.

翻译中…

But of course, not every ticket can be lucky. Far from it! Moreover, sometimes one look at a ticket can be enough to say right away that the ticket is not lucky. So, let's consider the following unluckiness criterion that can definitely determine an unlucky ticket. We'll say that a ticket is definitely unlucky if each digit from the first half corresponds to some digit from the second half so that each digit from the first half is strictly less than the corresponding digit from the second one or each digit from the first half is strictly more than the corresponding digit from the second one. Each digit should be used exactly once in the comparisons. In other words, there is such bijective correspondence between the digits of the first and the second half of the ticket, that either each digit of the first half turns out strictly less than the corresponding digit of the second half or each digit of the first half turns out strictly more than the corresponding digit from the second half.

翻译中…

For example, ticket $2421$ meets the following unluckiness criterion and will not be considered lucky (the sought correspondence is $2 > 1$ and $4 > 2$), ticket $0135$ also meets the criterion (the sought correspondence is $0 < 3$ and $1 < 5$), and ticket $3754$ does not meet the criterion.

翻译中…

You have a ticket in your hands, it contains $2*n*$ digits. Your task is to check whether it meets the unluckiness criterion.

翻译中…

Input

翻译中…

The first line contains an integer $*n*$ ($1 ≤ *n* ≤ 100$). The second line contains a string that consists of $2*n*$ digits and defines your ticket.

翻译中…

Output

翻译中…

In the first line print "YES" if the ticket meets the unluckiness criterion. Otherwise, print "NO" (without the quotes).

翻译中…

样例

Input #1
2
2421
Output #1
YES
InputCopy OutputCopy
Input #2
2
0135
Output #2
YES
InputCopy OutputCopy
Input #3
2
3754
Output #3
NO
InputCopy OutputCopy
题目信息
题号
160B
时间限制
2 s
内存限制
256 MB
标签
贪心
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。