Codeforce Round #219 Div2 A

A. Collecting Beats is Fun

time limit per test 1 second

memory limit per test 256 megabytes

 

Cucumber boy is fan of Kyubeat, a famous music game.

Kyubeat has 16 panels for playing arranged in 4 × 4 table. When a panel lights up, he has to press that panel.

Each panel has a timing to press (the preffered time when a player should press it), and Cucumber boy is able to press at most k panels in a time with his one hand. Cucumber boy is trying to press all panels in perfect timing, that is he wants to press each panel exactly in its preffered time. If he cannot press the panels with his two hands in perfect timing, his challenge to press all the panels in perfect timing will fail.

You are given one scene of Kyubeat's panel from the music Cucumber boy is trying. Tell him is he able to press all the panels in perfect timing.

Input

The first line contains a single integer k (1 ≤ k ≤ 5) — the number of panels Cucumber boy can press with his one hand.

Next 4 lines contain 4 characters each (digits from 1 to 9, or period) — table of panels. If a digit i was written on the panel, it means the boy has to press that panel in time i. If period was written on the panel, he doesn't have to press that panel.

Output

Output "YES" (without quotes), if he is able to press all the panels in perfect timing. If not, output "NO" (without quotes).

Sample test(s)

Input

1 
.135 
1247 
3468 
5789

Output

YES

Input

5 
..1. 
1111 
..1. 
..1.

Output

YES

Input

1 
.... 
12.1 
.2.. 
.2..

Output

NO

Note

In the third sample boy cannot press all panels in perfect timing. He can press all the panels in timing in time 1, but he cannot press the panels in time 2 in timing with his two hands.

#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <cstring>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define mod 1000000007
#define ll long long
#define maxn 1005
int w, k, n, m, ans;
int dp[maxn][maxn];
int a[505000],vis[505000];
char s[1010][1010];
struct node{
    int a, pos;
}t[505000];
int main(){
    scanf("%d", &n);
    for (int i = 0; i < 4; i++)scanf("%s", s[i]);
    for (int i = 0; i < 4;i++)
    for (int j = 0; j < 4;j++)
    vis[s[i][j] - '0']++;
    int flag = 1;
    for (int i = 1; i <= 9; i++){
        if (vis[i]>2 * n){ flag = 0; break; }
    }
    if (flag)printf("YES\n"); else printf("NO\n");
    return 0;
}