1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6 + 9;

int tab[MAX_N];

int n;

int main()
{
    scanf("%d", &n);

    long long sum = 0;

    for(int i = 0; i < n; ++i)
    {
        scanf("%d", &tab[i]);
        sum += tab[i];
    }

    long long maxx = 0;

    if(sum % 2 == 0)
        maxx = sum;

    for(int i = 0; i < n; ++i)
    {
        sum -= tab[i];

        if(sum % 2 == 0)
            maxx = max(maxx, sum);

        sum += tab[i];
    }

    if(maxx == 0)
        printf("NIESTETY");
    else
        printf("%lld", maxx);

    return 0;
}