Chef wants to buy a new phone, but he is not willing to spend a lot of money. Instead, he checks the price of his chosen model everyday and waits for the price to drop to an acceptable value. So far, he has observed the price for $N$ days (numbere $1$ through $N$); for each valid $i$, the price on the $i$-th day was $P_i$ dollars.
On each day, Chef considers the price of the phone to be good if it is strictly smaller than all the prices he has observed during the previous five days. If there is no record of the price on some of the previous five days (because Chef has not started checking the price on that day yet), then Chef simply ignores that previous day ― we could say that he considers the price on that day to be infinite.
Now, Chef is wondering ― on how many days has he considered the price to be good? Find the number of these days.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first line of each test case contains a single integer $N$.
- The second line contains $N$ space-separated integers $P_1, P_2, \dots, P_N$.

-----Output-----
For each test case, print a single line containing one integer ― the number of days with a good price.

-----Constraints-----
- $1 \le T \le 100$
- $7 \le N \le 100$
- $350 \le P_i \le 750$ for each valid $i$

-----Subtasks-----
Subtask #1 (30 points): $N = 7$
Subtask #2 (70 points): original constraints

-----Example Input-----
1
7
375 750 723 662 647 656 619

-----Example Output-----
2

-----Explanation-----
Example case 1: Chef considers the price to be good on day $1$, because he has not observed any prices on the previous days. The prices on days $2, 3, 4, 5, 6$ are not considered good because they are greater than the price on day $1$. Finally, the price on day $7$ is considered good because it is smaller than all of the prices on days $2, 3, 4, 5, 6$.

Difficulty: interview

Starter code:

Solutions:
for _ in range(int(input())):
 n=int(input())
 a=list(map(int,input().split()))
 g=1
 for j in range(1,n):
  if j-5<0:
   mi=min(a[0:j])
   #print(a[0:j])
   if mi>a[j]:
    g=g+1
  else:
   mi=min(a[j-5:j])
   #print(a[j-5:j])
   if mi>a[j]:
    g=g+1
 print(g)


# cook your dish here
t = int(input())
for i in range(t):
 n = int(input())
 p = list(map(int, input().split(" ")))
 count = 0
 for j in range(n):
  if(j==0):
   count = count + 1
  else:
   lst = []
   if(j<=5):
    for k in range(j):
     lst.append(p[k])
   else:
    e = j-5
    for k in range(e,j):
     lst.append(p[k])
   if(p[j]<min(lst)):
    count = count+1
 print(count)

# cook your dish here
n = int(input())
list2 = [751,751,751,751,751]
for i in range(n):
 x = int(input())
 list1 = list(map(int, (input().split())))
 list1 = list2+list1
 p = 0
 for i in range(5,len(list1)):
  a = list1[i-5]
  b = list1[i-4]
  c = list1[i-3]
  d = list1[i-2]
  e = list1[i-1]
  f = list1[i]
  r = min(a,b,c,d,e)
  if f < r :
   p +=1
 print(p)


# cook your dish here
for _ in range(int(input())):
 n=int(input())
 l=list(map(int,input().split()))
 count=1
 for i in range(1,n):
  j=i-1 
  a=0
  while j>=0 and j>=i-5:
   if l[j]>l[i]:
    j-=1
   else:
    a=1 
    break
  if a==0:
   count+=1 
 print(count)
   


# cook your dish here
t=int(input())
for _ in range(t):
 n=int(input())
 l=list(map(int,input().split()))[:n]
 count=1
 for i in range(1,n):
  li=[]
  for j in range(6):
   if (i-j)<0:
    break
   else:
    li.append(l[i-j])
  #print(li)
  li.sort()
  #print(li)
  if l[i]==li[0] and li[0]!=li[1]:
   count+=1
 print(count)


# cook your dish here
def prices(n,p):
 c=0
 for i in range(n):
  if i ==0:
   c+=1
  elif i<6:
   if p[i]< min(p[:i]):
    c+=1
  else:
   if p[i]<min(p[i-5:i]):
    c+=1
 return c
   
t = int(input())
for i in range(t):
 n = int(input())
 p = list(map(int, input().split()))
 print(prices(n,p))

# cook your dish here
for _ in range(int(input())):
 n = int(input())
 l = list(map(int,input().split()))
 count = 1
 for i in range(1,5):
  k = [] + l[:i]
  if min(k)>l[i]:
   count+=1
 for i in range(5, n):
  k = [] + l[i-5:i]
  if min(k)>l[i]:
   count+=1
 print(count)

# cook your dish here
for h in range(int(input())):
 n=int(input())
 l=list(map(int,input().split()))
 c=n
 for i in range(n):
  j=i-1
  while j>=i-5 and j>=0:
   if l[i]>=l[j]:
    c-=1
    break
   j-=1
 print(c)

for _ in range(int(input())):
 n=int(input())
 l=[int(j) for j in input().split()]
 count = 1
 for i in range(1, n):
  if i - 5 < 0:
   mini = min(l[0: i])
   if mini > l[i]:
    count += 1
  else:
   mini = min(l[i - 5: i])
   if mini > l[i]:
    count += 1
 print(count)
  
 


# cook your dish here
k = int(input())

for j in range(0, k):
 n = int(input())
 a = list(map(int,input().split()))
 count = 1
 for i in range(1, n):
  if i - 5 < 0:
   mini = min(a[0: i])
   if mini > a[i]:
    count += 1
  else:
   mini = min(a[i - 5: i])
   if mini > a[i]:
    count += 1
 print(count)

t=int(input())
for i in range(0,t):
 n=int(input())
 a=list(map(int,input().split()))
 g=1
 for j in range(1,n):
  if j-5<0:
   mi=min(a[0:j])
   #print(a[0:j])
   if mi>a[j]:
    g=g+1
  else:
   mi=min(a[j-5:j])
   #print(a[j-5:j])
   if mi>a[j]:
    g=g+1
 print(g)

# cook your dish here
T = int(input())
for i in range(T):
 N = int(input())
 P = input()
 P = P.split()
 p = []
 for j in P:
  p.append(int(j))
 count = 1
 for i in range(1,N):
  minval=p[i]
  if i<6 and minval<min(p[:i]):
   count += 1
  elif i>=6 and minval<min(p[i-5:i]):
   count += 1
 print(count)


from collections import(deque)
for _ in range(int(input())):
 n = int(input())
 a = list(map(int,input().split()))
 d = deque()
 ma = 100000000
 ans = 0
 for i in range(5):
  while d and a[d[0]]>a[i]:
    d.popleft()
  while d and a[d[-1]]>a[i]:
   d.pop()
  d.append(i)
  if a[i]<ma:
   ma = a[i]
   ans+=1
 for i in range(5,len(a)):
  if a[i]<a[d[0]]:
   ans+=1
   # print(a[i])
  while d and a[d[0]]>a[i]:
    d.popleft()
  while d and a[d[-1]]>a[i]:
   d.pop()
  d.append(i)
  if i-d[0] == 5:
   d.popleft()
 print(ans)

for _ in range(int(input())):
 n=int(input())
 l=list(map(int,input().split()))
 c=0
 for i in range(len(l)):
  if i==0:
   c+=1
  else:
   if i>=5:
    t_1=min(l[i-5:i])
   else:
    t_1=min(l[:i])
   if l[i]<t_1:
    c+=1
 print(c)


# cook your dish here
bleh=int(input())
for i in range(bleh):
 n=int(input())
 l=list(map(int,input().split()))
 k=0
 c=0
 for j in range(n):
  k=0
  if j<5:
   for p in range(j):
    if l[j]>=l[p]:
      k=1
      break
  else:
   for p in range(j-5,j):
    if l[j]>=l[p]:
     k=1
     break
  if k==0:
   c=c+1
 print(c)



t=int(input())
while(t>0):
 n=int(input())
 l=list(map(int,input().split()))
 c=1
 x=l[0]
 for i in range(1,n):
  if(x==l[max(i-6,0)]):
   x=min(l[max(0,i-5):i])
  else:
   x=min(l[i-1],x)
  if(l[i]<x):
   c+=1
 print(c)
 t-=1

t=int(input())
while(t>0):
 n=int(input())
 l=list(map(int,input().split()))
 c=1
 x=l[0]
 for i in range(1,n):
  if(x==l[max(i-6,0)]):
   x=min(l[max(0,i-5):i])
  else:
   x=min(l[i-1],x)
  if(l[i]<x):
   c+=1
 print(c)
 t-=1