k = int(input())
A = input()
B = input()

ll = []
c = 0
for i in range(0, len(A)-k+1):
    ai = A[i:i+k]
    if ai not in ll:
        c += B.count(ai)
        ll.append(ai)
    
print(c)
第一题这么写为啥20%