406555: GYM102439 I Equal Mod Segments

Given an array $$$a_1, a_2, \dots, a_n$$$, consisting of $$$n$$$ positive integers. You need to find a number of pairs $$$(L, R)$$$ (where $$$L \le R$$$) such that the following condition holds: $$$a_L \bmod a_{L+1} \bmod \dots \bmod a_R = a_R \bmod\ a_{R-1} \bmod \dots \bmod a_L$$$, where $$$\bmod$$$ is defined as operation of taking the remainder of the division.

The first line contains an integer $$$n$$$  — the size of the array.

The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$  — the elements of the array.

Print a single integer  — number of pairs $$$(L, R)$$$, satisfying the given condition.

2
5 5

3

3
8 3 5

4