import java.util.*;

public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} import java.util.*; util.* java public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} Main static int mod = (int) 1e9 + 7; mod (int) 1e9 + 7 (int) 1e9 7 static int dx[] = {-1, 0, 1, 0} dx {-1, 0, 1, 0} -1 1 0 1 0 dy[] = {0, -1, 0, 1}; dy {0, -1, 0, 1} 0 -1 1 0 1 static int INF = Integer.MAX_VALUE/2; INF Integer.MAX_VALUE/2 Integer.MAX_VALUE Integer Integer.MAX_VALUE 2 public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    } main {

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) String s = new String(scan.next()); s new String(scan.next()) String st = ""; st "" for(int i=0;i<s.length();i++){
            st = st + "x";
        } int i=0; int i=0; i 0 i<s.length() i s.length() s.length s i++ i++ i {
            st = st + "x";
        } {
            st = st + "x";
        } st = st + "x" st st + "x" st "x" System.out.println(st) System.out.println System.out System System.out st String args[] args static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    } factorial {
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    } if(n == 0){
          return 1;
        } n == 0 n 0 {
          return 1;
        } return 1; 1 return n * factorial(n-1); n * factorial(n-1) n factorial(n-1) factorial n-1 n 1 int n n public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


} Main
import java.util.*;

public class Main{

    static int mod = (int) 1e9 + 7;
    static int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1};
    static int INF = Integer.MAX_VALUE/2;

    public static void main(String args[]){

        Scanner scan = new Scanner(System.in);

        //Queue<int[]> q = new ArrayDeque<int[]>();
        String s = new String(scan.next());

        String st = "";
        for(int i=0;i<s.length();i++){
            st = st + "x";
        }
        System.out.println(st);
    }

    static int factorial(int n){
        if(n == 0){
          return 1;
        }
        return n * factorial(n-1);
    }


}