k = int(input())
d = {1:0,2:0,3:0,4:0,5:0,6:0,7:0,8:0,9:0}
flag = True
for i in range(4):
s = input()
for i in s:
if i == ".":
continue
else:
i = int(i)
d[i]+=1
for s,v in d.items():
if v > (2*k):
print("NO")
flag = False
break
if flag:
print("YES")#include <iostream>
#include <math.h>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int k, times[10] = { 0 };
cin >> k;
char a[4][4];
bool possible = true;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 4; j++)
{
cin >> a[i][j];
if (a[i][j] == '.')
continue;
int digit = a[i][j] - '0';
times[digit]++;
if (times[digit] > 2 * k)
possible = false;
}
}
if (possible)
cout << "YES";
else
cout << "NO";
return 0;
}
952A - Quirky Quantifiers | 451B - Sort the Array |
1505H - L BREAK into program | 171E - MYSTERIOUS LANGUAGE |
630D - Hexagons | 1690D - Black and White Stripe |
1688D - The Enchanted Forest | 1674C - Infinite Replacement |
712A - Memory and Crow | 1676C - Most Similar Words |
1681A - Game with Cards | 151C - Win or Freeze |
1585A - Life of a Flower | 1662A - Organizing SWERC |
466C - Number of Ways | 1146A - Love "A" |
1618D - Array and Operations | 1255A - Changing Volume |
1710C - XOR Triangle | 415C - Mashmokh and Numbers |
8A - Train and Peter | 591A - Wizards' Duel |
1703G - Good Key Bad Key | 1705A - Mark the Photographer |
1707A - Doremy's IQ | 1706B - Making Towers |
1325B - CopyCopyCopyCopyCopy | 1649C - Weird Sum |
1324B - Yet Another Palindrome Problem | 525A - Vitaliy and Pie |