#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector <T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair <T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 1e9 + 7;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;

using State = string::const_iterator;

int parseNumber(State& begin) {
    int ret = 0;
    while ('0' <= *begin and *begin <= '9') {
        ret *= 10;
        ret += *begin - '0';
        ++begin;
    }
    return ret;
}

void parse(State& begin) {
    if (*begin != '(') {
        return;
    }
    assert(*begin == '(');
    ++begin;
    parse(begin);
    assert(*begin == ')');
    ++begin;
    assert(*begin == '[');
    ++begin;
    parseNumber(begin);
    assert(*begin == ']');
    ++begin;
    assert(*begin == '(');
    ++begin;
    parse(begin);
    assert(*begin == ')');
    ++begin;
}

string parseTree(State& beginA, State& beginB) {
    if (*beginA != '(' or *beginB != '(') {
        parse(beginA);
        parse(beginB);
        return "";
    }
    string ret;
    assert(*beginA == '(');
    assert(*beginB == '(');
    ++beginA, ++beginB;
    ret += "(" + parseTree(beginA, beginB) + ")";

    assert(*beginA == ')');
    assert(*beginB == ')');
    ++beginA, ++beginB;
    assert(*beginA == '[');
    assert(*beginB == '[');
    ++beginA, ++beginB;

    int numA = parseNumber(beginA);
    int numB = parseNumber(beginB);
    ret += "[" + to_string(numA + numB) + "]";

    assert(*beginA == ']');
    assert(*beginB == ']');
    ++beginA, ++beginB;
    assert(*beginA == '(');
    assert(*beginB == '(');
    ++beginA, ++beginB;
    ret += "(" + parseTree(beginA, beginB) + ")";

    assert(*beginA == ')');
    assert(*beginB == ')');
    ++beginA, ++beginB;

    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    // ifstream in("in.txt");
    // cin.rdbuf(in.rdbuf());

    string A, B; cin >> A >> B;

    State beginA = A.begin();
    State beginB = B.begin();

    string ans = parseTree(beginA, beginB);
    cout << ans << endl;

    return 0;
}




Measured memory_bytes: 3308