S_N1

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

#include <fstream>
int S = 0;

bool f(int a, int b) {
    return a % 3 == 0 && b < S;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    bool sh  = 0;


    string data;
    //ifstream file("sum17.txt");
    ifstream file("test.txt");
    getline(file, data);
    int n = stoi(data);
    vector <int> v;

    for (int i = 0; i < n ; ++i) {
        getline(file, data);
        int x = stoi(data);
        v.pb(x);
        if (x % 2 == 0) {
            S += x/2;
        }
    }

    int ans = 0;
    int mx = -1;
    if (sh) {
        cout << "n = " << n << "\n";
        cout << "S = " << S << "\n";
    }
    for (int i = 0; i < n - 1; ++i) {
        int a = v[i];
        int b = v[i + 1];
        if (sh) {
            cout << "a b  = " << a << ' ' << b << "\n";
        }
        if (f(a, b) || f(b, a)) {
            ans++;
            mx = max(mx, a+b);
        }
    }
    cout << ans << ' ' << mx;
}