#include <iostream> #include <vector> #include <algorithm> #include <string> using namespace std; int fun(vector<int>& vec) { int num = 0; int left = 0; num += vec[5]; num += vec[4]; left = vec[4] * 11; num += vec[3]; int p = vec[3] * 5; if (p <= vec[1]) vec[1] = vec[1] - p; else { left += (p - vec[1]) * 4; vec[1] = 0; } if (vec[2] % 4 == 0) num += vec[2] / 4; else if (vec[2] % 4 == 1) { num += vec[2] / 4 + 1; if (5 <= vec[1]) { vec[1] -= 5; left += 11; } else { left += (5 - vec[1]) * 4 + 11; vec[1] = 0; } } else if (vec[2] % 4 == 2) { num += vec[2] / 4 + 1; if (3 <= vec[1]) { vec[1] -= 3; left += 6; } else { left += (3 - vec[1]) * 4 + 6; vec[1] = 0; } } else if (vec[2] % 4 == 3) { num += vec[2] / 4 + 1; if (1 <= vec[1]) { vec[1] -= 1; left += 5; } else { left += (1 - vec[1]) * 4 + 5; vec[1] = 0; } } p = vec[1] % 9; if (p == 0) num += vec[1] / 9; else { num += vec[1] / 9 + 1; left += (9 - p) * 4; } if (left >= vec[0]) return num; else { vec[0] -= left; return num + (vec[0] + 35) / 36; } } int main() { vector<vector<int>> data; int count; int t; while (true) { count = 0; vector<int> vec(6); for (int i = 0; i < 6; i++) { cin >> t; if (t == 0) count++; vec[i] = t; } if (count != 6) data.push_back(vec); else break; } for (int i = 0; i < data.size(); i++) { cout << fun(data[i]) << endl; } return 0; }