# Maximum Sum Non Adjacent Elements

easy

1. You are given a number n, representing the count of elements. 2. You are given n numbers, representing n elements. 3. You are required to find the maximum sum of a subsequence with no adjacent elements.

## Constraints

1 <= n <= 1000 -1000 <= n1, n2, .. n elements <= 1000

## Format

### Input

A number n n1 n2 .. n number of elements

### Output

A number representing the maximum sum of a subsequence with no adjacent elements.

## Example

Sample Input

6
5
10
10
100
5
6

### Sample Output

116

Question Video