package com.klu.tm1.

loops;
// https://goo.gl

import java.util.Scanner;

public class EncodingStrings1 {

public static void main(String[] args)
{
@SuppressWarnings("resource")
Scanner sc=new Scanner(System.in);
System.out.println("Enter input1:");
String input1=sc.next();
System.out.println("Enter input2:");
String input2=sc.next();
System.out.println("Enter input3:");
String input3=sc.next();
encodeThreeStrings(input1,input2,input3);
}

public static void encodeThreeStrings(String input1 ,String input2,String input3)

{
//case multiplies of 3 + one
int n1=input1.length();
int n2=input2.length();
int n3=input3.length();
String finput1="",minput1="",einput1="";
String finput2= "",minput2 = "",einput2="";
String finput3= "",minput3="",einput3="";
if(n1%3==1)
{
finput1=input1.substring(0,n1/3);
minput1=input1.substring(n1/3,(((2*n1)/3))+1); //case multiplies of 3 +
one
einput1=input1.substring((((2*n1)/3))+1,n1);
if(n2%3==2 && n3%3==0)
{
finput2=input2.substring(0,n2/3);
minput2=input2.substring(n2/3,(((2*n2)/3))+1); //case multiplies
of 3 + one
einput2=input2.substring((((2*n2)/3))+1,n2);

finput3=input3.substring(0,n3/3);
minput3=input3.substring(n3/3,(2*n3)/3); //case multiplies of 3
einput3=input3.substring((2*n3)/3,n3);
}
else if(n2%3==0 && n3%3==2)
{
finput2=input2.substring(0,n2/3);
minput2=input2.substring(n2/3,(2*n2)/3); //case multiplies of 3
einput2=input2.substring((2*n2)/3,n2);

finput3=input3.substring(0,((n3/3)+1));
minput3=input3.substring(((n3/3)+1),(2*n3)/3); //case
multiplies of 3 + two
einput3=input3.substring((2*n3)/3,n3);

}
}
 else if(n1%3==2)
{
finput1=input1.substring(0,n1/3);
minput1=input1.substring(n1/3,(((2*n1)/3))+1); //case multiplies
of 3 + one
einput1=input1.substring((((2*n1)/3))+1,n1);

if(n2%3==0 && n3%3==1)

{
finput2=input2.substring(0,n2/3);
minput2=input2.substring(n2/3,(2*n2)/3); //case multiplies of 3
einput2=input2.substring((2*n2)/3,n2);

finput3=input3.substring(0,n3/3);
minput3=input3.substring(n3/3,(((2*n3)/3))+1); //case multiplies of
3 + one
einput3=input3.substring((((2*n3)/3))+1,n3);

}
else if(n2%3==1 && n3%3==0)
{
finput2=input2.substring(0,n2/3);
minput2=input2.substring(n2/3,(((2*n2)/3))+1); //case multiplies of
3 + one
einput2=input2.substring((((2*n2)/3))+1,n2);

finput3=input3.substring(0,n3/3);
minput3=input3.substring(n3/3,(2*n3)/3); //case multiplies of 3
einput3=input3.substring((2*n3)/3,n3);
}
}

else if(n1%3==0)
{
finput1=input1.substring(0,n1/3);
minput1=input1.substring(n1/3,(2*n1)/3); //case multiplies of 3
einput1=input1.substring((2*n1)/3,n1);
if(n2%3==1 && n3%3==2)
{
finput2=input2.substring(0,n2/3);
minput2=input2.substring(n2/3,(((2*n2)/3))+1); //case multiplies of
3 + one
einput2=input2.substring((((2*n2)/3))+1,n2);

finput3=input3.substring(0,((n3/3)+1));
minput3=input3.substring(((n3/3)+1),(2*n3)/3); //case multiplies of 3
+ two
einput3=input3.substring((2*n3)/3,n3);
}
else if(n2%3==2 && n3%3==1)
{
finput2=input2.substring(0,((n2/3)+1));
minput2=input2.substring(((n2/3)+1),(2*n2)/3); //case multiplies of 3
+ two
einput2=input2.substring((2*n2)/3,n2);

finput3=input3.substring(0,n3/3);
 minput3=input3.substring(n3/3,(((2*n3)/3))+1); //case multiplies of 3
+ one
einput3=input3.substring((((2*n3)/3))+1,n3);

}
}

System.out.println(finput1.concat(minput2).concat(einput3));
System.out.println(minput1.concat(einput2).concat(finput3));

String str=(einput1.concat(finput2).concat(minput3));
int n=str.length();
for(int i=0;i<n;i++){
char ch=0;
ch=str.charAt(i);
if(Character.isUpperCase(ch)){
ch=Character.toLowerCase(ch);
System.out.print(ch);
}
else{
ch=Character.toUpperCase(ch);
System.out.print(ch);
}
}