Problem: You are given a straight half-line divided into segments of unit length, which we will call positions. The positions are numbered by positive integers that start with 1 from the end of half-line, i. e. 1, 2, 3 and so on. The distance between the positions is the absolute difference between the respective numbers. 

Laharl, Etna and Flonne occupy some positions on the half-line and they want to get to the position with the largest possible number. They are originally placed in different positions. 

Each of the characters can perform each of the following actions no more than once: 

  * Move a certain distance. 
  * Grab another character and lift him above the head. 
  * Throw the lifted character a certain distance. 



Each character has a movement range parameter. They can only move to free positions, assuming that distance between those positions doesn't exceed the movement range. 

One character can lift another character if the distance between the two characters equals 1, and no one already holds that another character. We can assume that the lifted character moves to the same position as the person who has lifted him, and the position in which he stood before becomes free. A lifted character cannot perform any actions and the character that holds him cannot walk. 

Also, each character has a throwing range parameter. It is the distance at which this character can throw the one lifted above his head. He can only throw a character to a free position, and only when there is a lifted character. 

We accept the situation when one person grabs another one who in his turn has the third character in his hands. This forms a "column" of three characters. For example, Laharl can hold Etna while Etna holds Flonne. In this case, Etna and the Flonne cannot perform any actions, and Laharl can only throw Etna (together with Flonne) at some distance. 

Laharl, Etna and Flonne perform actions in any order. They perform actions in turns, that is no two of them can do actions at the same time.

Determine the maximum number of position at least one of the characters can reach. That is, such maximal number x so that one of the characters can reach position x.

Input

The first line contains three integers: Laharl's position, his movement range and throwing range. The second and the third lines describe Etna's and Flonne's parameters correspondingly in the similar form. It is guaranteed that the three characters occupy distinct positions. All numbers in the input are between 1 and 10, inclusive.

Output

Print a single number — the maximum ordinal number of position which either Laharl, Etna or Flonne can reach.

Examples

Input

9 3 3
4 3 1
2 3 3


Output

15

Note

Let us explain how to reach position 15 in the sample.

Initially Laharl occupies position 9, Etna — position 4 and Flonne — position 2.

First Laharl moves to position 6.

Then Flonne moves to position 5 and grabs Etna.

Laharl grabs Flonne and throws to position 9.

Flonne throws Etna to position 12.

Etna moves to position 15.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using std::max;
const int maxn = 42 << 3;
int a[3], b[3], ans;
bool v[maxn][maxn][maxn];
void dfs(int A, int B, int C) {
  if (v[A][B][C]) return;
  v[A][B][C] = 1;
  int i, j, u, t, x, y;
  int p[3] = {A >> 3, B >> 3, C >> 3}, w[3] = {-1, -1, -1};
  bool g[3] = {0, 0, 0};
  if (t = A & 3, t == 1 || t == 2) g[w[0] = t] = 1;
  if (t = B & 3, t == 1 || t == 2) g[w[1] = (t == 1) ? 2 : 0] = 1;
  if (t = C & 3, t == 1 || t == 2) g[w[2] = t - 1] = 1;
  ans = max(max(ans, p[0]), max(p[1], p[2]));
  if (!g[i = 0]) {
    u = A, t = u & 3, x = 1, y = 2;
    if (w[i] == -1 && !((u >> 2) & 1))
      for (j = max(p[i] - a[i], 0); j <= p[i] + a[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          dfs((((j << 1) | 1) << 2) | t, B, C);
    if (!t) {
      if (!g[x] && (p[i] - p[x] == 1 || p[x] - p[i] == 1))
        if (w[x] == -1)
          dfs((u >> 2 << 2) | 1, (p[i] << 3) | (B & 7), C);
        else
          dfs((u >> 2 << 2) | 1, (p[i] << 3) | (B & 7), (p[i] << 3) | (C & 7));
      if (!g[y] && (p[i] - p[y] == 1 || p[y] - p[i] == 1))
        if (w[y] == -1)
          dfs((u >> 2 << 2) | 2, B, (p[i] << 3) | (C & 7));
        else
          dfs((u >> 2 << 2) | 2, (p[i] << 3) | (B & 7), (p[i] << 3) | (C & 7));
    }
    if (x == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs((u >> 2 << 2) | 3, (j << 3) | (B & 7), C);
          else
            dfs((u >> 2 << 2) | 3, (j << 3) | (B & 7), (j << 3) | (C & 7));
    } else if (y == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs((u >> 2 << 2) | 3, B, (j << 3) | (C & 7));
          else
            dfs((u >> 2 << 2) | 3, (j << 3) | (B & 7), (j << 3) | (C & 7));
    }
  }
  if (!g[i = 1]) {
    u = B, t = u & 3, x = 2, y = 0;
    if (w[i] == -1 && !((u >> 2) & 1))
      for (j = max(p[i] - a[i], 0); j <= p[i] + a[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          dfs(A, (((j << 1) | 1) << 2) | t, C);
    if (!t) {
      if (!g[x] && (p[i] - p[x] == 1 || p[x] - p[i] == 1))
        if (w[x] == -1)
          dfs(A, (u >> 2 << 2) | 1, (p[i] << 3) | (C & 7));
        else
          dfs((p[i] << 3) | (A & 7), (u >> 2 << 2) | 1, (p[i] << 3) | (C & 7));
      if (!g[y] && (p[i] - p[y] == 1 || p[y] - p[i] == 1))
        if (w[y] == -1)
          dfs((p[i] << 3) | (A & 7), (u >> 2 << 2) | 2, C);
        else
          dfs((p[i] << 3) | (A & 7), (u >> 2 << 2) | 2, (p[i] << 3) | (C & 7));
    }
    if (x == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs(A, (u >> 2 << 2) | 3, (j << 3) | (C & 7));
          else
            dfs((j << 3) | (A & 7), (u >> 2 << 2) | 3, (j << 3) | (C & 7));
    } else if (y == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs((j << 3) | (A & 7), (u >> 2 << 2) | 3, C);
          else
            dfs((j << 3) | (A & 7), (u >> 2 << 2) | 3, (j << 3) | (C & 7));
    }
  }
  if (!g[i = 2]) {
    u = C, t = u & 3, x = 0, y = 1;
    if (w[i] == -1 && !((u >> 2) & 1))
      for (j = max(p[i] - a[i], 0); j <= p[i] + a[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          dfs(A, B, (((j << 1) | 1) << 2) | t);
    if (!t) {
      if (!g[x] && (p[i] - p[x] == 1 || p[x] - p[i] == 1))
        if (w[x] == -1)
          dfs((p[i] << 3) | (A & 7), B, (u >> 2 << 2) | 1);
        else
          dfs((p[i] << 3) | (A & 7), (p[i] << 3) | (B & 7), (u >> 2 << 2) | 1);
      if (!g[y] && (p[i] - p[y] == 1 || p[y] - p[i] == 1))
        if (w[y] == -1)
          dfs(A, (p[i] << 3) | (B & 7), (u >> 2 << 2) | 2);
        else
          dfs((p[i] << 3) | (A & 7), (p[i] << 3) | (B & 7), (u >> 2 << 2) | 2);
    }
    if (x == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs((j << 3) | (A & 7), B, (u >> 2 << 2) | 3);
          else
            dfs((j << 3) | (A & 7), (j << 3) | (B & 7), (u >> 2 << 2) | 3);
    } else if (y == w[i]) {
      for (j = max(p[i] - b[i], 0); j <= p[i] + b[i]; ++j)
        if ((j != p[0] && j != p[1] && j != p[2]))
          if (w[x] == -1)
            dfs(A, (j << 3) | (B & 7), (u >> 2 << 2) | 3);
          else
            dfs((j << 3) | (A & 7), (j << 3) | (B & 7), (u >> 2 << 2) | 3);
    }
  }
}
int main() {
  if (0) {
    freopen("t.in", "r", stdin);
    freopen("t.out", "w", stdout);
  }
  int i, x[3];
  for (i = 0; i < 3; ++i) scanf("%d%d%d", x + i, a + i, b + i);
  dfs(x[0] - 1 << 3, x[1] - 1 << 3, x[2] - 1 << 3);
  printf("%d", ans + 1);
  return 0;
}