#include <stdio.h>
typedef int I;
#define F(n,a...)for(I i=0;i<n;i++){a;}
#define P(x)printf("%d\n",x);
#define N 2000
main(){FILE*f=fopen("in.txt","r");I a[N],g[N-1],w[N-3],s=0;F(N,fscanf(f,"%d",&a[i]));F(N-1,g[i]=a[i]<a[i+1]);F(N-1,s+=g[i]);P(s);s=1;F(N-3,w[i]=a[i]+a[i+1]+a[i+2]);F(N-3,g[i]=w[i]<w[i+1]);F(N-3,s+=g[i]);P(s);}

s=input()
h="$\\mathtt{"
j=0
for i in s:
 if   i==" ":h+="\\;"
 elif i=="$":
  if j:h+="\\mathtt{"
  else:h+="}"
  j=not j
 else:h+=i
h+="}$"
print(h)

(defn prefixes [x]
  (take-while identity
              ((fn p [prev n]
                 (if (seq n)
                   (let [np (lazy-cat prev [(first n)])]
                     (lazy-seq (cons np (p np (rest n)))))
                   nil)) [] x)))

(def prefixes
  (lambda (ls (backwards-prefix nil))
    (cons (reverse backwards-prefix)
      (if (nil? ls)
        nil
        (prefixes
          (tail ls)
          (cons (head ls) backwards-prefix))))))

class Eq a => Ord a where