This contest is `CODE FESTIVAL`. However, Mr. Takahashi always writes it `CODEFESTIVAL`, omitting the single space between `CODE` and `FESTIVAL`.

So he has decided to make a program that puts the single space he omitted.

You are given a string s with 12 letters. Output the string putting a single space between the first 4 letters and last 8 letters in the string s.

Constraints

* s contains exactly 12 letters.
* All letters in s are uppercase English letters.

Input

The input is given from Standard Input in the following format:


s


Output

Print the string putting a single space between the first 4 letters and last 8 letters in the string s. Put a line break at the end.

Examples

Input

CODEFESTIVAL


Output

CODE FESTIVAL


Input

POSTGRADUATE


Output

POST GRADUATE


Input

ABCDEFGHIJKL


Output

ABCD EFGHIJKL

import java.util.Comparator;
import java.util.Scanner;

public class Main {

	static final int INF=Integer.MAX_VALUE;
	static final long LINF=Long.MAX_VALUE;

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		String input = sc.next();
		sc.close();
		String output = input.substring(0, 4) + " " + input.substring(4, input.length()); 
		
		p(output);
		
		
		
	}
	
	
	
	
	public static void p(Number a) {
		System.out.println(a);		
	}
	public static void p(String a) {
		System.out.println(a);		
	}
	public static void pn(Number a) {
		System.out.print(a);		
	}
	public static void pn(String a) {
		System.out.print(a);		
	}
	
	public static int powerInt(int a, int b) {
		return (int) Math.pow(a, b);
	}

	public static int max(int arr[]) {
		int max = arr[0];
		
		for (int i=0; i<arr.length; i++) {
			if (max < arr[i]) {
				max = arr[i];
			}
		}
		
		return max;
	}
	public static double max(double arr[]) {
		double max = arr[0];
		
		for (int i=0; i<arr.length; i++) {
			if (max < arr[i]) {
				max = arr[i];
			}
		}
		
		return max;
	}	
	public static int min(int arr[]) {
		int max = arr[0];
		
		for (int i=0; i<arr.length; i++) {
			if (max > arr[i]) {
				max = arr[i];
			}
		}
		
		return max;
	}
	public static double min(double arr[]) {
		double max = arr[0];
		
		for (int i=0; i<arr.length; i++) {
			if (max > arr[i]) {
				max = arr[i];
			}
		}
		
		return max;
	}	

}




class CompUpInt implements Comparator {
	public int compare(Object o1,Object o2){
		int n1 = (int)o1;
		int n2 = (int)o2;
		return n1 - n2;
	}
}
class CompUpDbl implements Comparator {
	public int compare(Object o1,Object o2){
		double n1 = (double)o1;
		double n2 = (double)o2;
		return (n1 > n2) ? 1 : -1;
	}
}
class CompUpIntD2 implements Comparator {
	public int compare(Object o1,Object o2){
		int n1[] = (int[])o1;
		int n2[] = (int[])o2;
		return n1[1] - n2[1];
	}
}
