import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}
//Variables&Initialized 
int n;//no of sticks 
int integerArray[an];//no of chocalate sticks 
int d;//no of stick parts obtained by a THRU divisor 
public class numberSticksTest{
while{
    int n(); 
    int integerArray[an]={a1,a2,a3,a4,a5,a6,a7,a8,a9,an} 
    int an/divior i=int d>=1; 
    int d*assert();
    count+=dx;
    system.out.prntn(Total Stick Parts:    +"dx"+); 
}
}

    

-