Codeforce Round #224 Div2 A

A. Ksenia and Pan Scales

time limit per test 1 second

memory limit per test 256 megabytes

 

Ksenia has ordinary pan scales and several weights of an equal mass. Ksenia has already put some weights on the scales, while other weights are untouched. Ksenia is now wondering whether it is possible to put all the remaining weights on the scales so that the scales were in equilibrium.

The scales is in equilibrium if the total sum of weights on the left pan is equal to the total sum of weights on the right pan.

Input

The first line has a non-empty sequence of characters describing the scales. In this sequence, an uppercase English letter indicates a weight, and the symbol "|" indicates the delimiter (the character occurs in the sequence exactly once). All weights that are recorded in the sequence before the delimiter are initially on the left pan of the scale. All weights that are recorded in the sequence after the delimiter are initially on the right pan of the scale.

The second line contains a non-empty sequence containing uppercase English letters. Each letter indicates a weight which is not used yet.

It is guaranteed that all the English letters in the input data are different. It is guaranteed that the input does not contain any extra characters.

Output

If you cannot put all the weights on the scales so that the scales were in equilibrium, print string "Impossible". Otherwise, print the description of the resulting scales, copy the format of the input.

If there are multiple answers, print any of them.

Sample test(s)

Input

AC|T 
L

Output

AC|TL

Input

|ABC 
XYZ

Output

XYZ|ABC

Input

W|T 
F

Output

Impossible

Input

ABC| 
D

Output

Impossible

#pragma comment(linker,"/STACK:102400000,102400000")
#include <cstdio>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 1000005
int n, m;
char s1[maxn],s2[maxn];
int main(){
    scanf("%s%s", s1, s2);
    int t;
    n = strlen(s1);
    m = strlen(s2);
    for (int i = 0; i < n; i++){
        if (s1[i] == '|')t = i;
    }
    int x=n + m - 1;
    int y = min(t, n - t - 1);
    if (x % 2 != 0 || y + m < n - y - 1){ printf("Impossible\n"); return 0; }
    int j;
    for (j = 0; j < x / 2 - t; j++)printf("%c", s2[j]);
    printf("%s", s1);
    for (; j < m; j++)printf("%c", s2[j]);
    printf("\n");
    return 0;
}