Valery is very interested in magic. Magic attracts him so much that he sees it everywhere. He explains any strange and weird phenomenon through intervention of supernatural forces. But who would have thought that even in a regular array of numbers Valera manages to see something beautiful and magical.

Valera absolutely accidentally got a piece of ancient parchment on which an array of numbers was written. He immediately thought that the numbers in this array were not random. As a result of extensive research Valera worked out a wonderful property that a magical array should have: an array is defined as magic if its minimum and maximum coincide.

He decided to share this outstanding discovery with you, but he asks you for help in return. Despite the tremendous intelligence and wit, Valera counts very badly and so you will have to complete his work. All you have to do is count the number of magical subarrays of the original array of numbers, written on the parchment. Subarray is defined as non-empty sequence of consecutive elements.

Input

The first line of the input data contains an integer n (1 ≤ n ≤ 105). The second line contains an array of original integers a1, a2, ..., an ( - 109 ≤ ai ≤ 109). 

Output

Print on the single line the answer to the problem: the amount of subarrays, which are magical.

Please do not use the %lld specificator to read or write 64-bit numbers in C++. It is recommended to use cin, cout streams (you can also use the %I64d specificator).

Examples

Input

4
2 1 1 4


Output

5


Input

5
-2 -2 -2 0 1


Output

8

Note

Notes to sample tests:

Magical subarrays are shown with pairs of indices [a;b] of the beginning and the end.

In the first sample: [1;1], [2;2], [3;3], [4;4], [2;3].

In the second sample: [1;1], [2;2], [3;3], [4;4], [5;5], [1;2], [2;3], [1;3]. 
		import java.util.*;
		import java.util.*;
		import javax.swing.plaf.synth.SynthSpinnerUI;
		import javax.swing.plaf.synth.SynthStyle;
		import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
		import java.util.StringTokenizer;
		import java.io.BufferedReader;
		import java.io.IOException;
		import java.io.InputStreamReader;
		
		public class mohamedy23
				{
			//to order according region and score
		public static	class Pair implements Comparable<Pair> {
		  		int reg, score;String s;
		   
		  		public Pair(int reg, int score,String s) {
		  			this.reg = reg;
		  			this.score = score;
		  			this.s=s;
		  		}
		   
		  		public int compareTo(Pair A) {
		  			if(reg==A.reg)return A.score-score;
		  			return reg-A.reg;
		  		}
		  		public String toString() {
		  			return reg+" "+score+" "+s;
		  		}
		   
		  		
		  	}
				public static void main (String args[])throws NumberFormatException, IOException, InterruptedException
				    {
				    	Scanner sc=new Scanner(System.in);
				    
				    	int n=sc.nextInt();int a[]=new int[n];
				    	for(int i=0;i<n;i++)a[i]=sc.nextInt();long s=0L;long l=0;
				    	int u=0;int j=1;
				    	for(int i=0;i<a.length;i++) {s=0;
				    		for(j=i;j<a.length;j++) {
				    			if(a[i]==a[j])s++;
				    			else break;
				    		}
				    		l+=(long)(s*(s+1)/2);
				    		i=j-1;
				    	}
				        	
				        	System.out.print(l);
				        
				        	
				        	
				        	
				        	
				        }


				    
				    	
//				    	System.out.println(Arrays.toString(a));
//				    	System.out.println(Arrays.toString(b));
				    	
				    
			      static int binarySearch(int a[],int x) {
			    	  int l=0;int h=a.length-1;int mid =(l+h)/2;
			    	  
			    		l=0;h=a.length-1;  mid=(l+h)/2;
			    		  for( ;l<=h;) {mid=(l+h)/2;
			    		  if(x==a[mid])return mid;
			    		  else if(x>a[mid])l=mid+1;
			    		  else  h=mid-1;
			    	  
			    	  }
			    	  return -1;
			      }
			      
			   
			      
			      
			      
			      




				//	Bubble Sort    
			      static void bubbleSort(int a[]) 
			      { 
			          int n = a.length; 
			          for (int i = 0; i < n-1; i++) 
			              for (int j = 0; j < n-i-1; j++) 
			                  if (a[j] > a[j+1]) 
			                  { 
			                      // swap arr[j+1] and arr[i] 
			                      int temp = a[j]; 
			                      a[j] = a[j+1]; 
			                      a[j+1] = temp; 
			                  } 
			      }      
			    //Merge Sort
			      
			      	public static void mergeSort(int[] a, int n) {
			      	    if (n < 2) {
			      	        return;
			      	    }
			      	    int mid = n / 2;
			      	    int[] l = new int[mid];
			      	    int[] r = new int[n - mid];
			      	 
			      	    for (int i = 0; i < mid; i++) {
			      	        l[i] = a[i];
			      	    }
			      	    for (int i = mid; i < n; i++) {
			      	        r[i - mid] = a[i];
			      	    }
			      	    mergeSort(l, mid);
			      	    mergeSort(r, n - mid);
			      	 
			      	    merge(a, l, r, mid, n - mid);
			      	}
			      	
			      	public static void merge(
			      			  int[] a, int[] l, int[] r, int left, int right) {
			      			  
			      			    int i = 0, j = 0, k = 0;
			      			    while (i < left && j < right) {
			      			        if (l[i] <= r[j]) {
			      			            a[k++] = l[i++];
			      			        }
			      			        else {
			      			            a[k++] = r[j++];
			      			        }
			      			    }
			      			    while (i < left) {
			      			        a[k++] = l[i++];
			      			    }
			      			    while (j < right) {
			      			        a[k++] = r[j++];
			      			    }
			      			}
			      //Comparable Class to sort 2d array[n][2] according the first column
			    	
			      
			      static class Scanner {
				  		StringTokenizer st;
				  		BufferedReader br;

				  		public Scanner(InputStream system) {
				  			br = new BufferedReader(new InputStreamReader(system));
				  		}

				  		public Scanner(String file) throws Exception {
				  			br = new BufferedReader(new FileReader(file));
				  		}

				  		public String next() throws IOException {
				  			while (st == null || !st.hasMoreTokens())
				  				st = new StringTokenizer(br.readLine());
				  			return st.nextToken();
				  		}

				  		public String nextLine() throws IOException {
				  			return br.readLine();
				  		}

				  		public int nextInt() throws IOException {
				  			return Integer.parseInt(next());
				  		}

				  		public double nextDouble() throws IOException {
				  			return Double.parseDouble(next());
				  		}

				  		public char nextChar() throws IOException {
				  			return next().charAt(0);
				  		}

				  		public Long nextLong() throws IOException {
				  			return Long.parseLong(next());
				  		}

				  		public boolean ready() throws IOException {
				  			return br.ready();
				  		}

				  		public void waitForInput() throws InterruptedException {
				  			Thread.sleep(3000);
				  		}
				  	}
			      }
				 