//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

const int maxn = (int) 1e5;
int a[maxn];

int main() {
    int n;
    scanf("%d", &n);
    fo(i, n) scanf("%d", a + i);
    int p1, p2;
    scanf("%d%d", &p1, &p2);
    --p1, --p2;
    if (p1 == p2) {
        int sum1 = 0, sum2 = 0;
        fo(i, p1) sum1 += a[i];
        for (int j = p1 + 1; j < n; ++j) sum2 += a[j];
        cout << max(sum1, sum2) + a[p1] << ' '<< min(sum1, sum2) << endl;
        re 0;
    }
    bool _swap = p1 > p2;
    if (p1 > p2) swap(p1, p2);
    int middle = p1 + (p2 - p1 - 1) / 2 + (((p2 - p1 - 1) & 1) && !_swap);
    ll sum1 = 0, sum2 = 0;
    fo(i, n) {
        if (i <= middle) sum1 += a[i];
        else sum2 += a[i];
    }
    if (_swap) swap(sum1, sum2);
    cout << sum1 << ' '<< sum2 << endl;
}