def candies(n, arr):
    count = [None] * len(arr)
    
    # we use Depth-first search
    stack = list(range(len(arr)))
    while len(stack) > 0:
        i = stack[-1]
        # out of array or already known
        if i < 0 or i >= len(arr) or count[i] is not None:
            stack.pop()
        # left unknown value
        elif i >= 1 and arr[i] > arr[i-1] and count[i-1] is None:
            stack.append(i-1)
        # right unknown value
        elif i < len(arr) - 1 and arr[i] > arr[i+1] and count[i+1] is None:
            stack.append(i+1)
        # we know left and right value
        else:
            left = count[i-1] if i >= 1 and arr[i] > arr[i-1] else 0
            right = count[i+1] if i < len(arr) - 1 and arr[i] > arr[i+1] else 0
            count[i] = max(left, right) + 1
            stack.pop()

    return sum(count)

import java.io._

object Solution {
  def main(args: Array[String]): Unit = {
    val s = new java.util.Scanner(System.in)
    //val printWriter = System.out
    val printWriter = new PrintWriter(sys.env("OUTPUT_PATH"))

    val iarr = Array.fill(s.nextInt) { s.nextInt }
    val arr = (Integer.MAX_VALUE +: iarr) :+ Integer.MAX_VALUE

    val idx = Array.tabulate(iarr.length) {x => x + 1 }

    val c = new Array[Int](arr.length)

    val poses = idx.sortBy(x => arr(x))
    var res = 0L

    for {
      pos <- poses
    } {
      var w = 1
      if (arr(pos) > arr(pos-1))
        w = Math.max(w, c(pos-1) + 1)
      if (arr(pos) > arr(pos+1))
        w = Math.max(w, c(pos+1) + 1)
      c(pos) = w
      res += w
    }


    //printWriter.println(res)
    printWriter.close()
  }
}