main.cpp

#include <iostream>
#include <vector>

using namespace std;

long long round_half_up(long long total, long long count) {
    return (2 * total + count) / (2 * count);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    if (!(cin >> n)) {
        return 0;
    }
    vector<long long> values(n);
    for (int i = 0; i < n; ++i) {
        cin >> values[i];
    }
    long long total_change = values.back() - values.front();
    int longest = 1;
    int current = 1;
    for (int i = 1; i < n; ++i) {
        if (values[i] > values[i - 1]) {
            ++current;
        } else {
            current = 1;
        }
        if (current > longest) {
            longest = current;
        }
    }
    int recent_count = min(3, n);
    long long recent_sum = 0;
    for (int i = n - recent_count; i < n; ++i) {
        recent_sum += values[i];
    }
    long long forecast = round_half_up(recent_sum, recent_count);
    cout << "total_change=" << total_change << "\n";
    cout << "longest_rise=" << longest << "\n";
    cout << "forecast=" << forecast << "\n";
    return 0;
}