part 2 ques 2

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define pi acos(-1)
int maxvalue(int arr[],int size)
{
    int mx=-1e7;
    for(int i=0;i<size;i++)
        if(mx<arr[i])
            mx = arr[i];
    return mx;
}

int main()
{
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    int n;
    cin >> n;
    int arr[n];
    for(int i=0;i<n;i++)
        cin >> arr[i];
    int max_element = maxvalue(arr,n);
    cout << max_element << endl;

    return 0;
}