#include       <set>
#include       <map>
#include     <queue>
#include     <cmath>
#include    <cstdio>
#include    <cctype>
#include    <vector>
#include   <cstring>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll mod = 1e9+7;
const double eps = 1e-7;
const int maxn = 100005;

ll fast_pow(ll a,ll b,ll mod){
    ll ans = 1;
    while(b){
        if(b&1)
            ans = ans*a%mod;
        a = a*a%mod;
        b>>=1;
    }
    return ans;
}

int main(){
    char str[55], ptr[55];
    memset(str,0,sizeof(str));
    memset(ptr,0,sizeof(ptr));
    scanf("%s%s",str,ptr);
    for(int i=0;str[i]||ptr[i];i++){
        if(str[i])putchar(str[i]);
        if(ptr[i])putchar(ptr[i]);
    }
    return 0;
}
