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

int main() {
  int a0, a1, a2;
  cin >> a0 >> a1 >> a2;
  int db;
  cin >> db;
  int b0, b1, b2;
  cin >> b0 >> b1 >> b2;
  int dc;
  cin >> dc;
  int c0, c1, c2;
  cin >> c0 >> c1 >> c2;

  int ea = a0 * 1000 + a1 * 100 + a2;
  int eb = b0 * 1000 + b1 * 100 + b2;
  int ec = c0 * 1000 + c1 * 100 + c2;

  static int d[10001][11][101];
  memset(d, 0xff, sizeof(d));
  d[ea][a0][a1] = 0;
  int maxd = 0;
  for (int s = ea; s; --s) {
    for (int i = 0; i <= 10; ++i) {
      for (int j = 0; j <= 100; ++j) {
        if (d[s][i][j] < 0) continue;
        int k = s - i * 1000 - j * 100;
        if (k < 0) break;
        if (s >= db) {
          int x = min(i, db / 1000);
          int y = min(j, (db - x * 1000) / 100);
          int z = min(k, db - x * 1000 - y * 100);
          int m = x * 1000 + y * 100 + z;
          if (m == db) {
            d[s - m + eb][i - x + b0][j - y + b1] = max(d[s - m + eb][i - x + b0][j - y + b1], d[s][i][j] + 1);
            maxd = max(maxd, d[s - m + eb][i - x + b0][j - y + b1]);
          }
        }
        if (s >= dc) {
          int x = min(i, dc / 1000);
          int y = min(j, (dc - x * 1000) / 100);
          int z = min(k, dc - x * 1000 - y * 100);
          int m = x * 1000 + y * 100 + z;
          if (m == dc) {
            d[s - m + ec][i - x + c0][j - y + c1] = max(d[s - m + ec][i - x + c0][j - y + c1], d[s][i][j] + 1);
            maxd = max(maxd, d[s - m + ec][i - x + c0][j - y + c1]);
          }
        }
      }
    }
  }

  cout << maxd << endl;

  return 0;
}