#include <bits/stdc++.h>
using namespace std;
int n, ma[100001], tong, ln = -2147483648, vt, dem;
int main() 
{
    cin >> n;
    for(int a = 0; a < n; a++)
    {
        cin >> ma[a];
        if(a % 2 != 0 && ma[a] % 2 != 0)
        {
            tong += ma[a];
            dem++;
        }
        if(ma[a] > ln)
        {
            ln = ma[a];
            vt = a+1;
        }
    }
    cout << ln << " " << vt << "\n" << tong / dem;
    return 0;
}

$#khanhtaon$

#include<bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    int a[100005];
    for (int i = 0; i < n; i++) 
        cin >> a[i];
    int sum = 0, maxx = a[0], dir = 0, count = 0;
    for (int i = 0; i < n; i++){
        if(a[i] > maxx){
            maxx = a[i];
            dir = i;
        }
        if(i % 2 == 1 && a[i] % 2 == 1){
            sum += a[i];
            count++;
        }
    }
    cout << maxx << " " << dir + 1 << "\n" << sum / count << "\n";
}