#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 205;
int n, m, dp[MAX_N][MAX_N][MAX_N];
char a[MAX_N], b[MAX_N];
int f(int i, int j, int k) {
  if (k > 200) return 123456;
  if (i == n && j == m) return k;
  if (dp[i][j][k] != -1) return dp[i][j][k];
  int ans = f(i + (a[i] == '('), j + (b[j] == '('), k + 1);
  if (k) ans = min(ans, f(i + (a[i] == ')'), j + (b[j] == ')'), k - 1));
  return dp[i][j][k] = 1 + ans;
}
int main() {
  scanf("%s%s", a, b);
  n = strlen(a), m = strlen(b);
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= m; j++)
      for (int k = 0; k <= 200; k++) dp[i][j][k] = -1;
  int i = 0, j = 0, k = 0;
  while (i < n || j < m)
    if (f(i, j, k) == 1 + f(i + (a[i] == '('), j + (b[j] == '('), k + 1)) {
      putchar('(');
      i += a[i] == '(';
      j += b[j] == '(';
      k++;
    } else {
      putchar(')');
      i += a[i] == ')';
      j += b[j] == ')';
      k--;
    }
  while (k--) putchar(')');
  putchar('\n');
  return 0;
}
