#include <cstdlib>
#include <iostream>
 
using namespace std;
 
int main(int argc, char *argv[])
{
    int n;
    long long a[1000];
    bool firstblood = true;
    while(true)
    {
     cin>>n;
     if(n==0) break;
     for(int i=0;i<n;i++)
     {
      cin>>a[i];
     }
     int min=0;int max=0;
     for(int i=1;i<n-1;i++)
     {
      if(a[i]>a[i-1] && a[i]>a[i+1])
       max++;
      else if(a[i]<a[i-1] && a[i]<a[i+1])
       min++;
     }
     if(firstblood){firstblood = false;} else {cout<<endl;}
     cout<<min<<" "<<max;
    }
    system("PAUSE");
    return 0;
}

import java.util.ArrayList;
import java.util.Scanner;
 
 
public class ContestD {
 
  /**
   * @param args
   */
  
  
 
  @SuppressWarnings("resource")
  public static void main(String[] args) {
    // TODO Auto-generated method stub
    Scanner ScanTest=new Scanner(System.in);
    ArrayList<String>ListInput=new ArrayList<String>();
    int N=ScanTest.nextInt();
    while(N!=0)
    {
      String Data =ScanTest.nextLine();
      ListInput.add(Data.trim());
      N=ScanTest.nextInt();  
 
    }
//    System.out.println(ListInput.size());
    
    for(int i=0;i<ListInput.size();i++)
    {
      int Max=0,Min=0;
      String []tmp=ListInput.get(i).split(" ");
      int[]arr=new int[tmp.length];
      for(int j=0;j<arr.length;j++)
      {
        arr[j]=Integer.parseInt(tmp[j]);
      }
      
      for(int k=1;k<arr.length-1;k++)
      {
        if(arr[k]>arr[k-1]&&arr[k]>arr[k+1])Max++;
        if(arr[k]<arr[k-1]&&arr[k]<arr[k+1])Min++;
      }
      
      if(i<ListInput.size()-1)System.out.println(Min+" "+Max);
      else System.out.print(Min+" "+Max);
    }
  }
 
}

system("PAUSE");