In this problem you will meet the simplified model of game King of Thieves.

In a new ZeptoLab game called "King of Thieves" your aim is to reach a chest with gold by controlling your character, avoiding traps and obstacles on your way. [Image] 

An interesting feature of the game is that you can design your own levels that will be available to other players. Let's consider the following simple design of a level.

A dungeon consists of n segments located at a same vertical level, each segment is either a platform that character can stand on, or a pit with a trap that makes player lose if he falls into it. All segments have the same length, platforms on the scheme of the level are represented as '*' and pits are represented as '.'. 

One of things that affects speedrun characteristics of the level is a possibility to perform a series of consecutive jumps of the same length. More formally, when the character is on the platform number i_1, he can make a sequence of jumps through the platforms i_1 < i_2 < ... < i_{k}, if i_2 - i_1 = i_3 - i_2 = ... = i_{k} - i_{k} - 1. Of course, all segments i_1, i_2, ... i_{k} should be exactly the platforms, not pits. 

Let's call a level to be good if you can perform a sequence of four jumps of the same length or in the other words there must be a sequence i_1, i_2, ..., i_5, consisting of five platforms so that the intervals between consecutive platforms are of the same length. Given the scheme of the level, check if it is good.


-----Input-----

The first line contains integer n (1 ≤ n ≤ 100) — the number of segments on the level.

Next line contains the scheme of the level represented as a string of n characters '*' and '.'.


-----Output-----

If the level is good, print the word "yes" (without the quotes), otherwise print the word "no" (without the quotes).


-----Examples-----
Input
16
.**.*..*.***.**.

Output
yes
Input
11
.*.*...*.*.

Output
no


-----Note-----

In the first sample test you may perform a sequence of jumps through platforms 2, 5, 8, 11, 14.

Difficulty: interview

Starter code:

Solutions:
kk=0
x = int(input())
y = input()
z = [i for i in range(len(y)) if y[i] == '*']
for i in range(0, 100):
    for j in range(1, 100):
        if i in z and i+j in z and i+2*j in z and i+3*j in z and i+4*j in z:
            kk=1
if kk==1:
    print("yes")
else:
    print("no")


n = int(input())
s = input()
for ln in range(1, n):
    for i in range(n):
        if i + ln * 4 < n:
            if s[i] == s[i + ln] == s[i + ln * 2] == s[i + ln * 3] == s[i + ln * 4] == '*':
                print('yes')
                return
print('no')

n = int(input())
s = input() + '.' * 600

has = False
for dif in range(1, 101):
    for st in range(100):
        if s[st] == s[st + dif] == s[st + 2 * dif] == s[st + 3 * dif] == s[st + 4 * dif] == '*':
            has = True

print('yes' if has else 'no')


import sys
n = int(input())
S = input()
for l in range(n):
    if S[l] == "*":
        d = 1
        while l + 4 * d < n:
            if S[l + d] == S[l + 2 * d] == S[l + 3 * d] == S[l + 4 * d] == "*":
                print("yes")
                return
            d += 1
print("no")




n = int(input())
s = input().rstrip()
d = [[1 for i in range(n)] for i in range(n)]
maxx = 0
for i in range(n):
    if s[i] == '.':
        continue
    maxx = max(maxx, max(d[i]))
    for j in range(n):
        if i + j >= n:
            break
        d[i + j][j] = max(d[i + j][j], d[i][j] + 1)
print('yes' if maxx >= 5 else 'no')

n = int(input())
s = input()

ans = "no"
for i in range(len(s)):
    if(s[i]=='.'):
        continue
    for d in range(1, 100):
        cnt = 1
        j = i + d
        while(cnt < 5):
            if(j >= len(s)):
                break
            if(s[j] == '.'):
                break
            cnt+=1
            j+=d
        if(cnt==5):
            ans = "yes"
            break
    if(ans=="yes"):
        break
                
print(ans)


n = int(input())
s = input().strip()
for i in range(n):
	DP = [0] * n
	for j in range(n):
		if s[j] == "*":
			DP[j] = 1
			if j >= i and s[j - i] == '*':
				DP[j] += DP[j - i]
	if max(DP) >= 5:
		#print(i,max(DP))
		print("yes")
		return
print('no')

n = int(input())
level = input().strip()
for l in range(1, n + 1):
    for i in range(n - l + 1):
        for j in range(5):
            if i + l * j >= n or level[i + l * j] == '.':
                break
        else:
            print('yes')
            return
print('no')


import sys
n = int (sys.stdin.readline())
s = sys.stdin.readline().strip()
res = 'no'
for start in range (n):
  for l in range (1,n):
    for j in range (start, start+l*5, l):
      if j >= n:
        break
      if s[j] == '.':
        break
      if j == start + l * 4:
        res = 'yes'
print (res)




def main():
    n = int(input())
    s = input().rstrip()
    ar = [0] * n
    for i in range(n):
        for l in range(1, n):
            j = i
            sum1 = 0
            while j >= 0:
                if s[j] == '*':
                    sum1 += 1
                else:
                    break
                j -= l
            if sum1 >= 5:
                print('yes')
                return
    print('no')
main()



n = int(input())
s = input().strip()

result = False
for i in range(n-4):
    for j in range(1, (n - i - 1) // 4 + 1):
        #print(s[i:i + 4*j+1:j])
        if s[i:i + 4*j + 1:j] == '*****':
            result = True
if result:
    print("yes")
else:
    print("no")



n = int(input())
s = input()
flag = False
for i in range(n):
	for k in range(1,n):
		if i + 4*k < n:
			if s[i] == '*' and s[i + k] == '*' and s[i + 2*k] == '*' and s[i + 3*k] == '*' and s[i + 4*k] == '*':
				flag = True  
if flag == True:
	print('yes')
else:
	print('no')

n = int(input())
arr = list(input())
flag = False
for i in range(n):
    if arr[i] == '*':
        for d in range(1, n):
            begin = i
            for k in range(4):
                if (begin + d) < n and arr[begin + d] == '*':
                    begin += d
                else:
                    break
            else:
                flag = True
                break
    if flag:
        break
if flag:
    print('yes')
else:
    print('no')

import itertools
def king():
    n= int(input())
    s= input()
    a= []
    for i in range(len(s)):
        if s[i]== "*":
            a.append(i+1)
            
    #print(a)
    if len(a)< 5:
        print("no")
        return
    for arr in itertools.combinations(a, 5):
        arr= sorted(arr)
        mine= []
        for i in range(4):
            mine.append(arr[i+1]- arr[i])
        if len(set(mine))== 1:
            print("yes")
            return
    
    print("no")
    return
king()

import sys, os
import fileinput
n = int(input())
s = input().strip()

for i in range(1, n + 1):
	for j in range(1, n + 1):
		if j - 1 >= n or j - 1 + i >= n or j - 1 + 2*i >= n or j - 1 + 3*i >= n or j - 1 + 4*i >= n: break
		t = "%s%s%s%s%s" % (s[j - 1], s[j - 1 + i], s[j - 1 + 2*i], s[j - 1 + 3*i], s[j - 1 + 4*i])
		if t == "*****":
			print("yes")
			return

print("no")

def solve(level):
    level_size = len(level)

    def check(k, l):
        c = 0
        while k + l < level_size and '*' == level[k+l]:
            c += 1
            k += l
        return c >= 4

    for i in range(level_size):
        if '*' == level[i]:
            for j in range(i+1, level_size):
                if '*' == level[j] and check(i, j-i):
                    return 'yes'
    return 'no'


input()
print(solve(input().strip()))


n = int(input())
arr = list(input())
ans = False
for i in range(n):
    if arr[i] == "*":
        for j in range(1, n // 4 + 1):
            x = 0
            for z in range(i, n, j):
                if arr[z] == "*":
                    x += 1
                else:
                    break
            if x >= 5:
                ans = True
if ans:
    print("yes")
else:
    print("no")

def main():
    n = int(input())
    S = input()
    fl = 0
    for i in range(len(S)-3):
        if S[i] == '.':
            continue
        else:
            for j in range(1, len(S)//4+1):
                for k in range(5):
                    if i+k*j >= len(S) or S[i+k*j] == '.':
                        break
                else:
                    fl = 1
                    break
        if fl:
            break
    if fl:
        print('yes')
    else:
        print('no')
def __starting_point():
    main()

__starting_point()

import collections


input()
m = collections.defaultdict(set)
for i, ch in enumerate(input()):

    if ch == "*":

        m[i]
        for j in tuple(m):

            if i != j:

                m[min(i, j)].add(max(i, j) - min(i, j))

for node in sorted(m):

    for size in m[node]:

        count = 0
        current_node = node
        while count != 4:

            if size in m[current_node]:

                current_node += size
                count += 1

            else:

                break

        if count == 4:

            print("yes")
            return

print("no")


#!python3
n = input()
s = input()

good = False

for i in range(0, int(n)):
  for j in range(1, 27):
    try:
      if s[i]=='*' and s[i+j]=='*' and s[i+2*j]=='*' and s[i+3*j]=='*' and s[i+4*j]=='*':
        good = True
    except:
      pass

if good:
  print("yes")
else: 
  print("no")

#fin = open("input.txt")
#n = int(fin.readline())
#s = list(fin.readline())
n = int(input())
s = list(input())
F = False
for k in range(1, (n + 3) // 4 + 1):
	for i in range(n - 3):
		#print(i)
		flag = True
		for j in range(5):
			#print(i + j * k + 1, end = " ")
			if i + j * k >= n or s[i + j * k] == ".":
				flag = False
		#print(flag)
		if flag:
			F = True
			break
	if F:
		break
if F:
	print("yes")
else:
	print("no")


n = int(input())
line = input()
check = False
for i in range(1, (n // 4) + 1):
    for j in range((n - i * 4)):
        if line[j] == "*":
            if line[j] == line[j + i] == line[j + 2 * i] == line[j + 3 * i] == line[j + 4 * i]:
                print("yes")
                check = True
                break
    if check:
        break
if not check:
    print("no")

n = int(input())
lvl = input()

for start in range(0,107):
    for jump in range(1,40):
        if start+jump+jump+jump+jump >= len(lvl):
            break
        if lvl[start] == lvl[start+jump] == lvl[start+jump+jump] == lvl[start+jump+jump+jump]== lvl[start+jump+jump+jump+jump] == '*':
            print('yes')
            return

print('no')