write a go solution for Description:
You are given a permutation p of n integers 1, 2, ..., n (a permutation is an array where each element from 1 to n occurs exactly once).

Let's call some subsegment p[l,r] of this permutation special if p_l+p_r=maxlimits_i=l^rp_i. Please calculate the number of special subsegments.

Input Format:
The first line contains one integer n (3<=n<=2*10^5).

The second line contains n integers p_1, p_2, ..., p_n (1<=p_i<=n). All these integers are pairwise distinct.

Output Format:
Print the number of special subsegments of the given permutation.

Note:
Special subsegments in the first example are [1,5] and [1,3].

The only special subsegment in the second example is [1,3].. Output only the code with no comments, explanation, or additional text.