#include <iostream>
#include <algorithm>
using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int main() {

  int Aw, Ab; cin >> Aw >> Ab;
  int Bw, Bb; cin >> Bw >> Bb;
  int C, D; cin >> C >> D;

  int K = min(Ab, C);
  if(K < C) {
    int k = C - K;
    Aw -= k;
    Bw += k;
    K += k;
  }

  Bb += K;

  Aw += min(Bw, D);

  cout << Aw << endl;

  return 0;
}