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
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>
using namespace std;
int main()
{
long check,n;
cin >> n;
long tab[n];
for (long i=0;i!=n;i++)
{
    cin >> tab[i];
}
vector<long>result;
vector<long>temp;
result.push_back(0);
for (long i=0;i!=n;i++)
{
    long psize=result.size();
    for (long a=psize-1;a!=-1;a--)
    {
        temp.push_back(result[a]+tab[i]);
    }
    for (long x=0;x!=temp.size();x++)
    {
        result.push_back(temp[x]);
    }
    temp.clear();
}
temp.clear();
bool changed=false;
for (long i=0;i!=result.size();i++)
{
    if ((result[i])%2==0)
    {
        temp.push_back(result[i]);
        changed=true;
    }
}
long max=temp[0];
for (long i=0;i!=temp.size();i++)
{
    if (temp[i]>max)
    {
        max=temp[i];
    }
}
if (max>0)
{
cout<<max;
}
else
{
    cout << "NIESTETY";
}
}