#include<stdio.h>
#include <conio.h>
#include <Windows.h>
#include <malloc.h>
int vvod(char* str)
{
	int point = 0;
	int i = 0;
	fflush(stdin);
	while (1)
	{

		str[i] = getchar();

		if (str[i] == ' ')
			point = i;
		if (str[i] == '\n' && point != 0)
		{
			str[i] = '\0';
			break;
		}
		if (str[i] == '\n' && point == 0)
		{
			str[i] = str[i + 1];
			continue;
		}
		str = (char*)realloc(str, (i + 2) * sizeof(char));
		i++;
	}
	return i;
}
void exchange(char* str, int size)
{
	char temp;
	int n_sl1, k_sl1, n_sl2, k_sl2, i = 0, j;
	while (str[i] == ' ') i++;
	n_sl1 = i;
	while (str[i] != ' ' && str[i] != '\0') i++;
	k_sl1 = i - 1;
	i = 0;
	while (str[size - i - 1] == ' ') i--;
	k_sl2 = size - i - 1 - 1;
	while (str[size - i - 1] != ' ') i--;
	n_sl2 = size - i - 1 - 1;
	if (k_sl1 - n_sl1 > k_sl2 - n_sl2)  //первое слово длиннее второго
	{
		while (k_sl2 - n_sl2 >= 0)
		{
			temp = str[n_sl1];
			str[n_sl1] = str[n_sl2];
			str[n_sl2] = temp;
			n_sl1++;
			n_sl2++;
		}
		while (k_sl1 - n_sl1 >= 0)
		{
			j = k_sl1--;
			temp = str[j];
			while (j <= k_sl2) str[j++] = str[j + 1];
			str[k_sl2--] = temp;
		}
	}
	else            //второе слово длиннее первого
	{
		while (k_sl1 - n_sl1 >= 0)
		{
			temp = str[n_sl1];
			str[n_sl1] = str[n_sl2];
			str[n_sl2] = temp;
			n_sl1++;
			n_sl2++;
		}
		while (k_sl2 - n_sl2 >= 0)
		{
			j = n_sl2++;
			temp = str[j];
			while (j >= n_sl1) str[j--] = str[j - 1];
			str[n_sl1++] = temp;
		}
	}
}
int main()
{
	int i = 0, point=0, size;
	char* str = (char*)malloc(1 * sizeof(char));
	size=vvod(str);
	puts(str);
	exchange(str, size);
	puts(str);
	free(str);
	return 0;
}