Problem: This problem is given in two editions, which differ exclusively in the constraints on the number n.

You are given an array of integers a[1], a[2], ..., a[n]. A block is a sequence of contiguous (consecutive) elements a[l], a[l+1], ..., a[r] (1 ≤ l ≤ r ≤ n). Thus, a block is defined by a pair of indices (l, r).

Find a set of blocks (l_1, r_1), (l_2, r_2), ..., (l_k, r_k) such that:

  * They do not intersect (i.e. they are disjoint). Formally, for each pair of blocks (l_i, r_i) and (l_j, r_j) where i ≠ j either r_i < l_j or r_j < l_i. 
  * For each block the sum of its elements is the same. Formally, $$$a[l_1]+a[l_1+1]+...+a[r_1]=a[l_2]+a[l_2+1]+...+a[r_2]= ... = a[l_k]+a[l_k+1]+...+a[r_k].$$$ 
  * The number of the blocks in the set is maximum. Formally, there does not exist a set of blocks (l_1', r_1'), (l_2', r_2'), ..., (l_{k'}', r_{k'}') satisfying the above two requirements with k' > k. 

<image> The picture corresponds to the first example. Blue boxes illustrate blocks.

Write a program to find such a set of blocks.

Input

The first line contains integer n (1 ≤ n ≤ 50) — the length of the given array. The second line contains the sequence of elements a[1], a[2], ..., a[n] (-10^5 ≤ a_i ≤ 10^5).

Output

In the first line print the integer k (1 ≤ k ≤ n). The following k lines should contain blocks, one per line. In each line print a pair of indices l_i, r_i (1 ≤ l_i ≤ r_i ≤ n) — the bounds of the i-th block. You can print blocks in any order. If there are multiple answers, print any of them.

Examples

Input


7
4 1 2 2 1 5 3


Output


3
7 7
2 3
4 5


Input


11
-5 -4 -3 -2 -1 0 1 2 3 4 5


Output


2
3 4
1 1


Input


4
1 1 1 1


Output


4
4 4
1 1
2 2
3 3

Solution (in JAVA):

Solution:
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package Round547;

import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;

/**
 *
 * @author Hemant Dhanuka
 */
public class F1 {
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        
        int a[]=new int[n];
        
        for(int i=0;i<n;i++){
            a[i]=s.nextInt();
        }
        
        Map<Long,PriorityQueue<Node>> map=new HashMap();
        
        for(int i=0;i<n;i++){
            long sum=0;
            for(int j=i;j<n;j++){
                sum=sum+a[j];
                PriorityQueue<Node> pq=map.get(sum);
                if(pq==null){
                    pq=new PriorityQueue();
                    map.put(sum, pq);
                }
                pq.add(new Node(i,j));
            }
            
            
        }
        
        
        Set<Long> keys=map.keySet();
        
        Iterator<Long> itr=keys.iterator();
        int max=0;
        int solbackDp[]=null;
        Node solA[]=null;
        while(itr.hasNext()){
           Long sum=itr.next();
           PriorityQueue<Node> pq1=map.get(sum);
           Node rangelist[]=new  Node[pq1.size()+1];
           int count=1;
               rangelist[0]=new Node(-1,-1);
           while(!pq1.isEmpty()){
               rangelist[count]=pq1.poll();
               count++;
                       
           }
           int backTrack[]=new int[rangelist.length];
           int dp[]=new int[rangelist.length];
           Arrays.fill(dp, -1);
           int ans=fun(0,dp,rangelist,backTrack);
           if(ans>max){
               max=ans;
               solA=rangelist;
               solbackDp=backTrack;
           }
        }
        
        System.out.println(max);
        
        
        int pos=0;
        while(solbackDp[pos]!=-1){
            pos=solbackDp[pos];
            System.out.println((solA[pos].l+1)+" "+(solA[pos].r+1));
        }
    }
    
    
    static int fun(int pos,int dp[],Node[] rangeList,int bactTrack[]){
        
        if(pos==rangeList.length-1){
            bactTrack[pos]=-1;
            return 0;
          
        }
        
        if(dp[pos]!=-1){
            return dp[pos];
        }
        
        int i=pos+1;
        int maxAns=0;
        int nextPos=-1;
        for(;i<=rangeList.length-1;i++){
            
            
            if(rangeList[i].l>rangeList[pos].r){
                int tempAns=1+fun(i, dp,rangeList, bactTrack);
                if(tempAns>maxAns){
                    maxAns=tempAns;
                    nextPos=i;
                }
            }
        }
        
        dp[pos]=maxAns;
        bactTrack[pos]=nextPos;
        return maxAns;
        
        
        
        
    }
    
    static class Node implements Comparable<Node>{
        int l;
        int r;

        public Node(int l, int r) {
            this.l = l;
            this.r = r;
        }
        
        
        
       
        @Override
        public int compareTo(Node o2) {
            if(this.l!=o2.l){
                return this.l-o2.l;
            } else{
                return this.r-o2.r;
            }
        }
        
    }
}