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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    long long n, i, t, suma = 0;
    std::vector<long long> tab;
    cin >> n;
    for(i = 0; i < n; i++)
    {
        cin >> t;
        tab.push_back(t);
        suma += t;
    }
    std::sort(tab.begin(), tab.end());
    if (suma % 2 == 0)
    {
        cout << suma;
    }
    else
    {
        if (tab.size() == 1)
        {
            cout << "NIESTETY";
            return 0;
        }
        else
        {
            for(i = 0; i < tab.size(); i++)
            {
                if (tab[i] % 2 == 1)
                {
                    cout << suma - tab[i];
                    return 0;
                }
            }
            cout << "NIESTETY";
        }
    }
    return 0;
}