optimal

#include <bits/stdc++.h>
#include <iostream>

using namespace std;

int dist(const pair<int, int> &a, const pair<int, int> &b)
{
    return abs(a.first - b.first) + abs(a.second - b.second);
}

int solve(int n, pair<int, int> home, pair<int, int> office, vector<pair<int, int>> cust)
{
    vector<pair<int, pair<int, int>>> dp((1 << n));
    dp[0] = {0, office};

    for (int mask = 1; mask < (1 << n); mask++)
    {
        dp[mask] = {INT_MAX, {-1, -1}};
    }

    for (int mask = 0; mask < (1 << n); mask++)
    {
        for (int j = 0; j < n; j++)
        {
            if ((mask & (1 << j)) == 0)
            {
                // j is not in mask

                pair<int, int> last = dp[mask].second;
                int cur_dist = dp[mask].first + dist(last, cust[j]);

                if (cur_dist < dp[mask ^ (1 << j)].first)
                {
                    dp[mask ^ (1 << j)] = {cur_dist, cust[j]};
                }
            }
        }
    }
    int ans = dp[(1 << n) - 1].first + dist(dp[(1 << n) - 1].second, home);
    cout << dp[(1 << n) - 1].second.first << " " << dp[(1 << n) - 1].second.second << " \n";
    return ans;
}

int main()
{
    int n;
    cin >> n;
    pair<int, int> home, office;
    cin >> home.first >> home.second;
    cin >> office.first >> office.second;
    vector<pair<int, int>> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].first >> v[i].second;
    }

    int ans = solve(n, home, office, v);
    cout << ans << "\n";
    return 0;
}