#include <bits/stdc++.h>
#include <algorithm>

#define endl '\n';


const int N = 1e6 + 10;
const int M = 2e6 + 10;
const int P = 998244353; 
const int Base = 3221225477;
const int INF = 0x3f3f3f3f3f3f3f3f; 

int mod(int x)
{
   return x % P;
}
using namespace std;
string o,e;
signed main()
{
	cin >> o >> e;
	int op = 0;
	int ep = 0;
	for(int i = 0;i < o.size()+e.size();i++)
	{
		if(i % 2 != 0)
		{
			cout << e[ep];ep++;
		}else if(i % 2 == 0)
		{
			cout << o[op];op++;
		}
	}
	cout << endl;return 0;
}