#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll Aw, Ab, Bw, Bb, C, D;
    cin >> Aw >> Ab >> Bw >> Bb >> C >> D;

    // 黒石が十分にない
    if(Ab<C){
        ll diff = C-Ab;
        Aw -= diff; // 白石を持ち出す
        Bw += diff;
    }

    // 白石が足りない
    ll white;
    if(Bw<D){
        white = Aw + Bw;
    }
    else{
        white = Aw + D;
    }

    p(white);
    
    return 0;
}