Problem Statement

Equilibrium You are given an array A of N integers. An equilibrium position is a position where the sum of all integers on its left is equal to the sum of all integers on its right in the array A . Print the index of the equilibrium position. Note: For any given array there is only a single equilibrium position; if no equilibrium position is found then print NOT FOUND without quotes. The array is 1 indexed. Input Format The input consists of two lines: The first line contains an integer denoting N . The second line contains N space-separated integers denoting the elements of the array A . Input will be read from the STDIN by the candidate. Output Format Print the index of the equilibrium position. If no equilibrium position is found, print NOT FOUND without quotes. The output will be matched to the candidate's output printed on the STDOUT. Constraints 2 < N < 100 -10^5 < A[i] < 10^5 A[i] is not equal to 0 . The array has at most one equilibrium position. Every partial sum f