asuka-mirai

from collections import Counter

N = int(input())
a = list(map(int, input().split()))
ans = 0

for k, v in Counter(a).items():
    if k < v:
        ans += (v-k)
    if k > v:

asuka-mirai

s = input()
s_asc = ''.join(sorted(s))

t = input()
t_dsc = ''.join(sorted(t, reverse = True))

if s_asc < t_dsc:
    print('Yes')
else:
    print('No')

asuka-mirai

s = input()
print(s.rfind('Z') - s.find('A') + 1)

asuka-mirai

INF = float('inf')

def solve():
    N, Ma, Mb = map(int, input().split())
    l = []
    for _ in range(N):
        a, b, c = map(int, input().split())
        l.append((a, b, c))
 
    dp = [[[INF] * 401 for _ in range(401)] for _ in range(N + 1)]

asuka-mirai

N, M = map(int, input().split())

g = [[] for i in range(N)] #隣接リスト

for i in range(M):
    a, b = map(int, input().split())
    g[a-1].append(b-1)
    g[b-1].append(a-1)

memo = {}

asuka-mirai

N, M = map(int, input().split())
adj_matrix = [[0]* N for _ in range(N)]

for i in range(M):
    a, b = map(int, input().split())
    adj_matrix[a-1][b-1] = 1
    adj_matrix[b-1][a-1] = 1

def dfs(v, used):
    if not False in used:

asuka-mirai

import itertools

N, M = map(int, input().split())
adj_matrix = [[0]* N for _ in range(N)]

for i in range(M): #隣接行列
    a, b = map(int, input().split())
    adj_matrix[a-1][b-1] = 1
    adj_matrix[b-1][a-1] = 1

asuka-mirai

N, M = map(int, input().split())

if M >= 2 * N:
    M_left = M - 2 * N
    print(N + M_left // 4)
else:
    print(M // 2)

asuka-mirai

N = int(input())
C = 10**9+7
ans = 1
for i in range(1, N + 1):
    ans *= i
    ans %= C
print(ans)

asuka-mirai

import math

N = int(input())
C = 10**9 + 7

print(math.factorial(N) % C)