#include <bits/stdc++.h>   using namespace std;   void solve() {     int n;     cin >> n;     vector<int> arr(n);     vector<pair<int, int>> sorted_arr(n);     for (int i = 0; i < n; i++) {       cin >> arr[i];       sorted_arr[i] = {arr[i], i};     }     sort(sorted_arr.begin(), sorted_arr.end());     vector<int> pos(n);     for (int i = 0; i < n; i++) {       pos[i] = sorted_arr[i].second;     }     vector<int> next(n), prev(n);     next[n - 1] = n;     for (int i = n - 2; i >= 0; i--) {       int j = i + 1;       while (j < n && arr[i] > arr[j]) {         j = next[j];       }       next[i] = j;     }     prev[0] = -1;     for (int i = 1; i < n; i++) {       int j = i - 1;       while (j >= 0 && arr[i] > arr[j]) {         j = prev[j];       }       prev[i] = j;     }     int ans = 0;     for (int i = 1; i < n - 1; i++) {       if (i - prev[i] < next[i] - i) {         for (int j = prev[i] + 1; j < i; j++) {           int k = pos[arr[i] - arr[j] - 1];           if (i < k && k < next[i]) ans++;         }       } else {         for (int j = next[i] - 1; j > i; j--) {           int k = pos[arr[i] - arr[j] - 1];           if (prev[i] < k && k < i) ans++;         }       }     }     cout << ans;   }   signed main() {     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);     solve();     cout <<   n ;   }   