#include <bits/stdc++.h>
using namespace std;
int arr[100005];
int arr2[100005];
int gcd(int a, int b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
int lcm(int a, int b) {
  int res = (a * b) / gcd(a, b);
  return res;
}
int po(int a, int b) {
  int res = 1;
  while (b) {
    if (b % 2 != 0) {
      res *= a;
      b--;
    } else {
      a *= a;
      b /= 2;
    }
  }
  return res;
}
long long int modMul(long long int a, long long int b, long long int mod) {
  long long int ans = 0;
  a = a % mod;
  while (b > 0) {
    if (b % 2) ans = (ans % mod + a % mod) % mod;
    a = (a % mod * 2 % mod) % mod;
    b /= 2;
  }
  return ans % mod;
}
long long int powerMod(long long int a, long long int b, long long int mod) {
  if (b == 0) return 1LL % mod;
  long long int x = powerMod(a, b / 2, mod);
  x = (x % mod * x % mod) % mod;
  if (b % 2 == 1) x = (x % mod * a % mod) % mod;
  return x % mod;
}
int main() {
  string a, b;
  cin >> a >> b;
  int len1 = a.size();
  int len2 = a.size();
  if (len1 == len2) {
    for (int i = 0; i < len1; i++) {
      cout << a[i];
      cout << b[i];
    }
  } else if (len1 > len2) {
    len1--;
    for (int i = 0; i < len1; i++) {
      cout << a[i];
      cout << b[i];
    }
    cout << a[len1];
  } else {
    len2--;
    for (int i = 0; i < len2; i++) {
      cout << b[i];
      cout << a[i];
    }
    cout << b[len2];
  }
}
