#include <bits/stdc++.h>

using namespace std;

ifstream f("date.in");
ofstream g("date.out");
struct NOD
{
    int inf;
    NOD * st,*dr;
};
NOD * creare()
{   int x;
    f>>x;
    if(x==0)
        return NULL;
    else
    {
        NOD * nou;
        nou=new NOD;
        nou->inf=x;
        nou->st=creare();
        nou->dr=creare();
    }
}

int maxim(NOD *p)
{
    if(p!=NULL)
    {
        int m;
        m=max(maxim(p->st),maxim(p->dr));
        if(m==0)
            m=p->inf;
        return m;
    }
    return 0;
}


int suma(NOD *p)
{
    if(p!=NULL)
    {
        int s1,s2;
        s1=suma(p->st);
        s2=suma(p->dr);
        return s1+s2+p->inf;
    }
    else
        return 0;
}
int main()
{
    NOD *r;
    r=creare();
    g<<"Nodul maxim este : ";
    g<<maxim(r)<<endl;
    g<<"Suma nodurilor grafului este : ";
    g<<suma(r)<<endl;
    return 0;
}