A Very Big Sum

You are given an array of integers of size N$N$. You need to print the sum of the elements in the array, keeping in mind that some of those integers may be quite large.

Input

The first line of the input consists of an integer N$N$. The next line contains N$N$ space-separated integers contained in the array.

Constraints
1≤N≤10$1\le N\le 10$
0≤A[i]≤1010$0\le A[i]\le {10}^{10}$

Sample Input
5
1000000001 1000000002 1000000003 1000000004 1000000005

Output
Print a single value equal to the sum of the elements in the array. In the above sample, you would print 5000000015$5000000015$.

Note: The range of the 32-bit integer is (−231) to (231−1) or [−2147483648,2147483647]$(-2^{31})to(2^{31}-1)or[-2147483648,2147483647]$.
When we add several integer values, the resulting sum might exceed the above range. You might need to use long long int in C/C++ or long data type in Java to store such sums.

SOLUTION:

#include <math.h>

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

#include <assert.h>

#include <limits.h>

#include <stdbool.h>

int main(){

    int n; 

    scanf("%d",&n);

    long int arr[n],count=0;

    for(int arr_i = 0; arr_i < n; arr_i++){

       scanf("%ld",&arr[arr_i]);

       count=count+arr[arr_i]; 

    }

    printf("%ld",count);

    return 0;

}