def TKNP(s):
    global n,a
    l=0;r=n-1
    while l<=r:
        mid=(l+r)//2
        if a[mid]==s: return mid
        elif a[mid]<s:
            l=mid+1
        else:
            r=mid-1
n=int(input())
a=list(map(int,input().split()))
s=max(a)
print(s)
print(TKNP(s))
#（￣︶￣）↗　meothinhle

`@`$\color{ Turquoise }{\texttt{C++}}$

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
  int n; cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  auto x = max_element(a.begin(), a.end());
  int Mx = *x;
  int Vt = distance(a.begin(), x);
  cout << Mx << endl << Vt + 1;
}

`@`$\color{ Turquoise }{\texttt{Python}}$

n = int(input())
a = list(map(int, input().split()))
Mx = max(a)
Vt = a.index(Mx)
print(Mx)
print(Vt)

$\color{Turquoise}{\triangleright \triangleright\ \color{ Turquoise}{\texttt{ItzPhuc} \triangleleft \triangleleft}}$