12869.cpp

#include <bits/stdc++.h>
using namespace std;
#define INF 987654321

int dp[61][61][61], a[3], n, visited[61][61][61];
int _a[6][3] = {
    {9, 3, 1}, {9, 1, 3}, {3, 1, 9}, {3, 9, 1}, {1, 3, 9}, {1, 9, 3}};

struct A
{
    int a, b, c;
};

queue<A> q;
int solve(int a, int b, int c)
{
    visited[a][b][c] = 1;
    q.push({a, b, c});
    while (q.size())
    {
        int a = q.front().a;
        int b = q.front().b;
        int c = q.front().c;
        q.pop();
        if (visited[0][0][0])
            break;
        for (int i = 0; i < 6; i++)
        {
            int nexta = max(0, a - _a[i][0]);
            int nextb = max(0, b - _a[i][1]);
            int nextc = max(0, c - _a[i][2]);
            if (visited[nexta][nextb][nextc])
                continue;
            visited[nexta][nextb][nextc] = visited[a][b][c] + 1;
            q.push({nexta, nextb, nextc});
        }
    }
    return visited[0][0][0] - 1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    cout << solve(a[0], a[1], a[2]) << "\n";
    return 0;
}