A long time ago, in a galaxy far far away two giant IT-corporations Pineapple and Gogol continue their fierce competition. Crucial moment is just around the corner: Gogol is ready to release it's new tablet Lastus 3000.

This new device is equipped with specially designed artificial intelligence (AI). Employees of Pineapple did their best to postpone the release of Lastus 3000 as long as possible. Finally, they found out, that the name of the new artificial intelligence is similar to the name of the phone, that Pineapple released 200 years ago. As all rights on its name belong to Pineapple, they stand on changing the name of Gogol's artificial intelligence.

Pineapple insists, that the name of their phone occurs in the name of AI as a substring. Because the name of technology was already printed on all devices, the Gogol's director decided to replace some characters in AI name with "#". As this operation is pretty expensive, you should find the minimum number of characters to replace with "#", such that the name of AI doesn't contain the name of the phone as a substring.

Substring is a continuous subsequence of a string.


-----Input-----

The first line of the input contains the name of AI designed by Gogol, its length doesn't exceed 100 000 characters. Second line contains the name of the phone released by Pineapple 200 years ago, its length doesn't exceed 30. Both string are non-empty and consist of only small English letters.


-----Output-----

Print the minimum number of characters that must be replaced with "#" in order to obtain that the name of the phone doesn't occur in the name of AI as a substring.


-----Examples-----
Input
intellect
tell

Output
1
Input
google
apple

Output
0
Input
sirisiri
sir

Output
2


-----Note-----

In the first sample AI's name may be replaced with "int#llect".

In the second sample Gogol can just keep things as they are.

In the third sample one of the new possible names of AI may be "s#ris#ri".

Difficulty: interview

Starter code:

Solutions:
def main():

    a = str(input())
    b = str(input())

    print(a.count(b))


def __starting_point():
    main()
__starting_point()

s = input()
k = input()
print(s.count(k))

a = input()
b = input()
print(a.count(b))


a = str(input())
b = str(input())
ct = 0
if b in a:
    ct += a.count(b)
print(ct)

a = input()
b = input()
print(a.count(b))


s = input()
st = input()
print(s.count(st, 0, len(s)))


s=str(input())
t=str(input())
ans=s.count(t)
print(ans)





def __starting_point():
    s1 = input()
    s2 = input()
    print(s1.count(s2))

__starting_point()

# import string
# import sys
# import json
# import queue
# import math
# import matplotlib.pyplot as plt
# import matplotlib.patches as patch
#
# class Sheree:
#     def __init__(self,x,y,r):
#         self.x = x
#         self.y = y
#         self.r = r
#         self.to_right = 200-x+r
#         self.to_left = x-r
#
#     def have_route(self, shere):
#         return math.sqrt((self.x - shere.x)**2+(self.y-shere.y)**2) <= self.r+shere.r
#
#     def __str__(self):
#         return str(self.x)+'_'+str(self.y)+'_'+str(self.r)
#
# def bfs(start):
#     q = queue.Queue()
#     q.put(start)
#     used = {}
#     p = {}
#     d = {}
#     for i in routes:
#         used[i]=False
#         p[i]=-1
#         d[i]=0
#     p[start]=-1
#     used[start]=True
#     while(not q.empty()):
#         v = q.get()
#         for to in routes[v]:
#             if(not used[to]):
#                 used[to]=True
#                 q.put(to)
#                 d[to]=d[v]+1
#                 p[to]=v
#     return [used, d, p]
#
#
#
# n = int(input())
#
# sheres = {}
# routes = {}
# fig = plt.figure()
# plt.ylim([-100,400])
# plt.xlim([-100,400])
# plt.autoscale(True,False,False)
# for i in range(n):
#     a = input().split(' ')
#     [x,y,r] = [int(x) for x in a]
#     circle = plt.Circle((x,y),radius=r,fill=False)
#     plt.text(x,y, i)
#     fig.gca().add_artist(circle)
#     shere = Sheree(x,y,r)
#     sheres[str(shere)]=shere
# fig.gca().add_patch(patch.Rectangle((0,0),200,300,fill=False))
# fig.gca().set_aspect(1)
#
# print(sheres)
# ar = []
# for i in sheres:
#     ar.append(sheres[i])
#     for j in sheres:
#         if(i != j):
#             if sheres[i].have_route(sheres[j]):
#                 if i in routes:
#                     routes[i].add(j)
#                 else:
#                     routes[i] = set([j])
#                 if j in routes:
#                     routes[j].add(i)
#                 else:
#                     routes[j] = set([i])
#             else:
#                 if i not in routes:
#                     routes[i]=set([])
#
# ar.sort(key= lambda x: x.x)
#
# print(routes)
# res = bfs(str(ar[0]))
# print(res[0])
# print(res[1])
# print(res[2])
# fig.savefig('res.png')
# plt.show()
#


str = input()
str2 = input()

print(str.count(str2))

t = input()
p = input()
s = p + '&' + t 
n = len(s)
k = len(p)
z = [0] * n
l = 0
r = 0
for i in range(1, n):
    if i <= r:
        z[i] = min(r - i + 1, z[i - l])
    while i +z[i] < n and s[z[i]] == s[i + z[i]]:
        z[i] += 1
    if i + z[i] - 1 > r:
        r = i + z[i] - 1
        l = i
ans = 0
i = len(p) - 1
while i < n:
    if z[i] == len(p):
        ans += 1
        i += k
    else:
        i += 1

print(ans)


ai = input()
siri = input()
print(ai.count(siri))

def main():
	s = input()
	p = input()
	print(s.count(p))

		


def __starting_point():
	main()
__starting_point()

string = input()
name = input()
print(string.count(name))

g = input()
p = input()
t = g.count(p)
print(t)

from collections import deque
a = list(input())
b = list(input())
d = deque()
ret = 0
for i in range(min(len(b)-1, len(a))):
    d.append(a[i])
for i in range(len(b)-1, len(a)):
    d.append(a[i])
    if len(d) > len(b):
        d.popleft()
    remove = len(d) == len(b)
    if remove:
        for j in range(len(d)):
            if d[j] != b[j]:
                remove = False
                break
    if remove:
        ret += 1
        d.clear()
print(ret)


A = input()
B = input()

c = 0
s = 0

i = 0
e = len(A) - len(B)
while i <= e:
    AA = A[i:i+len(B)]
    if AA == B:
        c += 1
        i += len(B) - 1
    i += 1

print(c)


a=list(input())
b=list(input())
r=0
for i in range(len(a)-len(b)+1):
	if a[i:i+len(b)] == b:
		r+=1
		a[i+len(b)-1] = '#'
print(r)

import sys
import re

a = sys.stdin.readline().strip()
b = sys.stdin.readline().strip()

print(len(re.findall(b, a)))


a = input()
b = input()
'''n = len(a)
m = len(b)
cnt = 0
fl = False
for i in range(n - m):

'''
print(a.count(b))


a = input()
b = input()

nIndex = 0
nSum = 0
while True :
	nRet = a.find(b, nIndex)
	if nRet == -1 :
		break;
	nSum += 1
	nIndex = nRet + len(b)
print(nSum)


main = input()
sub = input()

ans = main.count(sub)
print (ans)

a = input()
b = input()
ans = 0
pos = a.find(b)
while pos != -1:
    #tmp = b.replace(b[0], '#', 1)
    a = a[(pos + len(b)):]
    ans += 1
    #print(a)
    pos = a.find(b)
print(ans)

a = input().rstrip()
b = input().rstrip()

def prefix_fn(string, pattern):
    s = pattern + "$" + string
    p = [0] * len(s)
    k = 0
    for i, c in enumerate(s[1:], 1):
        while s[k] != c and k > 0:
            k = p[k-1]
        if s[k] == c:
            k += 1
        p[i] = k
    return p[len(pattern)+1:]

last_occ = -1
m = len(b)
count = 0
for i, c in enumerate(prefix_fn(a, b)):
    if last_occ != -1:
        last_occ += 1
    if c == m and (last_occ >= m or last_occ == -1):
        count += 1
        last_occ = 0

print(count)


n = input()
m = input()
print(n.count(m))

google = input()
apple = input()
answer = 0
if (apple in google):
    answer = google.count(apple)
print(answer)