Problem:
 Score : 200 points    Problem Statement  Given is a string S . Replace every character in S with x and print the result.      Constraints   S is a string consisting of lowercase English letters.  The length of S is between 1 and 100 (inclusive).         Input  Input is given from Standard Input in the following format:  S       Output  Replace every character in S with x and print the result.        Sample Input 1 sardine      Sample Output 1 xxxxxxx  Replacing every character in S with x results in xxxxxxx .       Sample Input 2 xxxx      Sample Output 2 xxxx       Sample Input 3 gone      Sample Output 3 xxxx

Solution (Python):
S = input()

print("x"*(len(S)))

Solution (Python):
s = input()
l = len(s)
print("x"*l)

Solution (Python):
print("x"*len(input()))

Solution (Python):
s = input()
print("x"*len(s))

Solution (Python):
s = input()

print('x' * len(s))

Solution (Python):
i = len(input())
print('x'*i)

Solution (Python):

if __name__ == '__main__':
    s = input()
    x = ""
    for i in range(len(s)):
        x = x + "x"
    print(x)

Solution (Python):
s = input()
ans = "x" * len(s)
print(ans)

Solution (Python):
s = list(input())
for i in range(len(s)):
    print("x",end="")

Solution (Python):
s=input()
print('x'*len(s))

Solution (Python):
t = "x"*len(input())
print(t)

Solution (Python):
s = input()
l = len(s)
ans = 'x' * l
print(ans)

Solution (Python):
def changex(s):

    ans = ""

    for i in range(len(s)):
        ans += "x"

    return ans

def main():
    s = str(input())
    print(changex(s))

if __name__ == '__main__':
    main()

Solution (Python):
S=input()
ans="x"*len(S)
print(ans)

Solution (Python):
S = str(input())

ans = 'x' * len(S)

print(ans)

Solution (Python):
str = input()
print("x" * len(str))

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
s=input()
s=list(s)
for i in range(len(s)):
    s[i]='x'

ans=''
for ss in s:
    ans+=str(ss)
print(ans)

Solution (Python):



import sys
readline = sys.stdin.readline
read = sys.stdin.read



s = input()

print("x"*len(s))

Solution (Python):
S = input()
for i in range(len(S)):
    print("x" ,end='')

Solution (Python):
S = input()
S_len = len(S)
print('x'*S_len)

Solution (Python):
S = input()
L = len(S)
ans = ""
for i in range(L):
    ans += "x"

print(ans)

Solution (Python):
S = input()
leng = len(S)

print("x" * leng)

Solution (Python):
S = len(input())

print("x" * S)

Solution (Python):
import sys
from pprint import pprint

def solve(s):
    print("x" * len(s))

if __name__ == '__main__':
    s = sys.stdin.readline().strip()
    solve(s)

Solution (Python):
s = input()
print('x' * len(s))

Solution (Python):
S = input()
for i in range(len(S)):
    print("x",end="")

Solution (Python):
s = input()

a = ""
for i in range(len(s)):
    a += "x"
print(a)

Solution (Python):
S = input()


n = len(S)
print("x"*n)

Solution (Python):
a = list(input())

print("x"*len(a))

Solution (Python):
S=list(input())
print("x"*len(S))

Solution (Python):
S=input()
ans=""
for i in range(len(S)):
    ans+="x"

print(ans)

Solution (Python):
u=input()
length=len(u)
t=[]
for i in range(length):
    t.append("x")

print(''.join(t))

Solution (Python):


n = input()
size = len(n)
for i in range(size):
    print("x", end = "")

Solution (Python):
S = input()

ans = "x" * len(S)

print(ans)

Solution (Python):
print("x"*len(input()))

Solution (Python):
print ("x"*len(input()))

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
s = input()
print("x"*len(s))

Solution (Python):
S,o=input(),""
for i in range(len(S)):
    o=o+"x"
print(o)

Solution (Python):
s = str(input())
S = ""
for i in range(len(s)):
  S += "x"
print(S)

Solution (Python):
len_S=len(input())
answer_list=[]
for i in range(len_S):
  answer_list.append('x')
  
print("".join(answer_list))

Solution (Python):
S = input()
result = "x" * len(S)
print(result)

Solution (Python):
s = input()
print('x' * len(s))

Solution (Python):
s = input()

for _ in range(len(s)):
  print("x", end="")

Solution (Python):
S = input()

ans = 'x' * len(S)

print(ans)

Solution (Python):
S = input()

result = 'x' * len(S)

print(result)

Solution (Python):
s = input()
s_len = len(s)
print('x'*s_len)

Solution (Python):
s = input()
s_len = len(s)
ans = 'x' * s_len
print(ans)

Solution (Python):
s = input()
n = len(s)
print('x'*n)

Solution (Python):
s = input()
a = ""
for i in range(len(s)):
    a += "x"
print(a)

Solution (Python):
S = input()

L = len(S)

print("x"*L)

Solution (Python):
s=input()
answer="x"*len(s)
print(answer)

Solution (Python):
S = str(input())
n = len(S)
print("x"*n)

Solution (Python):

"""
Created on Sun Feb  9 20:52:25 2020

@author: H_Hoshigi
"""

S = input()
answer = ""
for i in range(len(S)):
    answer += "x"

print(answer)

Solution (Python):
S = input()

print(''.join(['x' for s in S]))

Solution (Python):
S = input()
l= len(S)
A = []
for _ in range(l):
    A.append("x")

print("".join(A))

Solution (Python):

S = input()
S1 = ""
n = len(S)
for _ in range(n):
    S1 = S1 + "x"
print(S1)

Solution (Python):
s=input()
print("x"*len(s))

Solution (Python):
print("x"*len(input()))

Solution (Python):
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('sardine'), 'xxxxxxx')

    def test_2(self):
        self.assertEqual(think('xxxx'), 'xxxx')

    def test_3(self):
        self.assertEqual(think('gone'), 'xxxx')


def solve():
    s = read()
    result = think(s)
    write(result)


def read():
    return read_line()


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(s):
    return 'x' * len(s)


def write(result):
    print(result)


if __name__ == '__main__':
    
    solve()

Solution (Python):
s=input()
n=len(s)
ans="x"*n
print(ans)

Solution (Python):
S = len(input())
print("x"*S)

Solution (Python):
s=input()
print("x"*len(s))

Solution (Python):

s = input()

print (len(s)*'x')

Solution (Python):
print("x"*len(input()))

Solution (Python):
S = input()
print("x" * len(S))

Solution (Python):
s = list(input())
n = len(s)
ans = ""
for i in range(n):
    ans += "x"
print(ans)

Solution (Python):
s = input()
num = len(s)
print("x" * num)

Solution (Python):
s = input()
a = len(s)

l = ["x"] * a
print("".join(l))

Solution (Python):
s = input()
print("x"*len(s))

Solution (Python):
s = input()
x = 'x' * len(s)
print(x)

Solution (Python):
s = input()

len_s = len(s)
print('x'*len_s)

Solution (Python):

s = input()
print('x' * len(s))

Solution (Python):
s = input()

for _ in range(len(s)):
    print("x", end="")

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

    
    
    
    
    
    
    
    
    S = r()
    print('x'*len(S))

    
    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
s = str(input())
print("x"*len(s))

Solution (Python):

import sys
import math
import numpy as np
import itertools


m = list(input())


for i in range(len(m)):
    print("x",end="")
print("")

Solution (Python):
def main():
    s = input()
    print('x'*len(s))

main()

Solution (Python):
S = input()
print("x" * len(S))

Solution (Python):
S = input()
N = len(S)
X = ["x"]*N
print("".join(X))

Solution (Python):
def resolve():
    s=input()
    print("x"*len(s))

if __name__ == "__main__":
    resolve()

Solution (Python):
S = input()

ans = ''

for i in range(len(S)):
    ans += 'x'

print(ans)

Solution (Python):
S = input()
ans = ""
for i in range(len(S)):
  ans += "x"
print(ans)

Solution (Python):
S = input()

temp = 'x' * len(S)

print(temp)

Solution (Python):
S = input()

print('x'*len(S))

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
print("x" * len(input()))

Solution (Python):

import sys






def main():
    s = input()
    ans = ""
    for i in range(len(s)):
        ans += "x"
    print(ans)
    


    
if __name__ == '__main__':
    main()

Solution (Python):
u = input()

a = "x"*len(u)
print(a)

Solution (Python):
import math
import itertools


s = input()
t = ""
for i in range(len(s)):
    t += "x"

print(t)

Solution (Python):
str = input()
print('x' * len(str))

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
s=input()

le=len(s)

ans="x"

for i in range(le-1):
    ans=str(ans)+"x"

print(ans)

Solution (Python):
print("x" * len(input()))

Solution (Python):
print("x"*len(input()))

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()
    print('x' * len(S))

main()

Solution (Python):
s = input()

print('x'*len(s))

Solution (Python):
S = input()

print("x" * len(S))

Solution (Python):
s = input()

ans = "x"*len(s)

print(ans)

Solution (Python):
s=input()
for i in range(len(s)):
    print('x', end='')

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
s=input()
n=len(s)
for i in range(n):
  print('x',end='')

Solution (Python):
s=str(input())
count=len(s)
res = "x" * count
print(res)

Solution (Python):
print('x' * len(input()))

Solution (Python):

S = str(input())
print("x"*len(S))

Solution (Python):
S = input()
length = len(S)

for i in range(length):
    print("x", end = "")

Solution (Python):
s = input()

ans = ''
for _ in range(len(s)):
    ans += 'x'
print(ans)

Solution (Python):
print("x" * len(input()))

Solution (Python):
s = input()

print("".join(["x"]*len(s)))

Solution (Python):
print("x" * len(input()))

Solution (Python):
r=input()
s=""
for _ in range(len(r)):
    s+="x"
print(s)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
s = input()
lens = len(s)
print('x'*lens)

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
S=input()
print('x'*len(S))

Solution (Python):
S = len(input())
ans = ""
for i in range(S):
    ans += "x"
print(ans)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
s = input()

ans = ""
for i in range(len(s)):
    ans += "x"
print(ans)

Solution (Python):
s = str(input())



print("x" * len(s))

Solution (Python):
s=input()
for i in range(len(s)):
    print("x",end="")

Solution (Python):
S = str(input())
x = len(S)

for i in range(x):
  print("x", end = "")

Solution (Python):
inputf = input

s = inputf()
output = ""
for i in range(len(s)):
    output += 'x'
print(output)

Solution (Python):
S = input()
print("x"*len(S))

Solution (Python):
S = input()

for _ in range(len(S)):
    print('x', end='')

Solution (Python):
S = str(input())

print('x' * len(S))

Solution (Python):
str = input()
out = ""
for i in range(len(str)):
  out = out + "x"

print(out)

Solution (Python):
S = input()
r = ""
for i in range(len(S)):
    r += 'x'
print(r)

Solution (Python):
U = input()
n = len(U)
print("x"*n)

Solution (Python):
S = input()

ans = []

for i in range(len(S)):
    ans.append("x")

ans = [str(s) for s in ans]
print("".join(ans))

Solution (Python):
s = input()
str = ""
for i in range(len(s)):
  str += 'x'
print(str)

Solution (Python):
S = list(str(input()))
for i in range(len(S)):
  S[i] = 'x'
  
ans = ''.join(S)
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
s=len(input().strip())
ans=""
for _ in range(s):
    ans+="x"
print(ans)

Solution (Python):
S = input()


print('x' * len(S))

Solution (Python):
S=input()
ans = ''
for i in range(len(S)):
    ans = ans + 'x'

print(ans)

Solution (Python):
S = input()
print("x" * len(S))

Solution (Python):
S = input()
print('x' * len(S))

Solution (Python):
print("x" * len(input()))

Solution (Python):
s = input()
res =''
for _ in range(len(s)):
    res+='x'
print(res)

Solution (Python):


S = input()

length = len(S)

print('x'*length)

Solution (Python):
S=input()
for i in range(len(S)):
  print("x",end="")

Solution (Python):
S = input()
l = len(S)

ans = ["x"] * l

print("".join(ans))

Solution (Python):
print('x'*len(input()))

Solution (Python):




s = input()


ans = ""
for i in range(len(s)):
    ans = ans + "x"


print(ans)

Solution (Python):
S=input()
print('x'*len(S))

Solution (Python):
import sys
import re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
ans = 'x' * len(S)
print(ans)

Solution (Python):
s=str(input())
l=len(s)
print("x"*l)

Solution (Python):
from bisect import bisect_right, bisect_left
from collections import Counter, deque
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import groupby, permutations, combinations, product
from sys import stdin, stderr





def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)





def exgcd(x, y):
    if y == 0:
        return 1, 0
    a, b = exgcd(y, x % y)
    return b, a - (x // y) * b



def lcm(x, y):
    m = gcd(x, y)
    return (x // m) * (y // m)


def main():
    s = input()
    ret = "x" * len(s)
    return ret


if __name__ == "__main__":
    print(main())

Solution (Python):
S = input()
N = len(S)
s = 'x' * N

print(s)

Solution (Python):

import sys


def solve(S: str):
    print("x"*len(S))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
def main(s):
    return "x"*len(s)

s = input()
print(main(s))

Solution (Python):
print('x' * len(input()))

Solution (Python):
s = input()
a = ""

for _ in range(len(s)):
    a += 'x'
    
print(a)

Solution (Python):
S = str(input())
n = len(S)
ans = ""
for i in range(n):
  ans += "x"
print(ans)

Solution (Python):
S=input()
L=len(S)
ans=''
for i in range(L):
	ans=ans+'x'
print(ans)

Solution (Python):
S = input()
T = ""
for i in range(0,len(S)):
    T = T+"x"
print (T)

Solution (Python):
s = input()
output = 'x' * len(s)
print(output)

Solution (Python):
n=len(input())
print('x'*n)

Solution (Python):


print("x" * len(input()))

Solution (Python):
import numpy as np

if __name__ == "__main__":
  _s = input()
  l = list(_s)

  ans = ""
  for i in l:
    ans = ans + str("x")
  print(ans)

Solution (Python):
S = input()

L = len(S)

print("x"*int(L))

Solution (Python):
S = input()

print('x'*len(S))

Solution (Python):
s = input()
n = len(s)
out = "x" * n
print(out)

Solution (Python):
S=input()
ls=len(S)

print("x"*ls)

Solution (Python):
def main():
    S = input()
    lenS = len(S)
    
    ans = ""
    for i in range(lenS):
        ans += "x"
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()
num = len(s)
print('x' * num)

Solution (Python):
s = input()

l = len(s)

print("x"*l)

Solution (Python):
s = input()
print('x'*len(s))

Solution (Python):
S = str(input())


print("x"*len(S))

Solution (Python):

S = input()

print("x" * len(S))

Solution (Python):
s = input()
l = len(s)

ans = ""

for i in range(len(s)):
    ans += "x"

print(ans)

Solution (Python):
s=input()
ans=['x' for i in range(len(s))]

print(''.join(ans))

Solution (Python):
S = input()
print("x" * len(S))

Solution (Python):
''' Hey stalker :) '''
INF = 10**10
def main():
    
    ''' Cook your dish here! '''
    s = input()
    print('x'*len(s))



''' Pythonista fLite 1.1 '''
import sys
from collections import defaultdict, Counter
from bisect import bisect_left, bisect_right

import math

out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()

print(*out, sep='\n')

Solution (Python):
S=len(input())
print('x'*S)

Solution (Python):
s = input()
print("x" * len(s))

Solution (Python):
S=input()

L=len(S)

ans=""

for i in range(L):
    ans+="x"

print(ans)

Solution (Python):
s=input()
print('x'*len(s))

Solution (Python):
S = input()

ans = "x" * len(S)
print(ans)

Solution (Python):
print("x" * len(input()))

Solution (Python):
s = input()
  
print('x'*len(s))

Solution (Python):
S = input("")
for i in range(len(S)):
    print("x",end="")

Solution (Python):
print('x'*len(input()))

Solution (Python):
s = input()
l = len(s)
print("x" * l)

Solution (Python):
print('x' * len(input()))

Solution (Python):
def run():
  S = input()
  n = len(S)
  print('x'*n)

if __name__ == '__main__':
    run()

Solution (Python):
s = len(input())
ans = "x"*s
print(ans)

Solution (Python):
S = input()

print('x' * len(S))

Solution (Python):
S=input()
ans=""
for i in range(len(S)):
  ans+="x"
print(ans)

Solution (Python):
print('x'*len(input()))

Solution (Python):
S = str(input())
print('x'*len(S))

Solution (Python):
S = input()

l = len(S)

print('x' * l)

Solution (Python):
S=input()
ans=[]
x=""
for i in range(len(S)):
    x+="x"
print(x)

Solution (Python):
S = input()
for _ in range(len(S)):
    print("x", end="")

Solution (Python):
s = input()
print('x'*(len(s)))

Solution (Python):
inputstr = input()

print('x' * len(inputstr))

Solution (Python):
X = input()

print("x"*len(X))

Solution (Python):
u = input()

k = len(u)
words = ["x" for i in range(k)]
print("".join(words))

Solution (Python):
S = input()
for _ in S:
    print("x",end="")

Solution (Python):
S = input()
length = len(S)
print("x"*length)

Solution (Python):
def main():
    s = input()
    ans = ''
    for i in range(len(s)):
        ans += 'x'
    print(ans)
if __name__=='__main__':
    main()

Solution (Python):



def solve(*args: str) -> str:
    return 'x'*len(args[0])


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Solution (Python):
s=input()

print("x"*len(s))

Solution (Python):
s = input()
res = ''

for i in range(len(s)):
  res += 'x'
  
print(res)

Solution (Python):
s = str(input())
s_l = len(s)
ans = ""
for i in range(s_l):
  ans += "x"
print(ans)

Solution (Python):
c = input()
S = len(c)
print("x"*S)

Solution (Python):
s = input()
print('x' * len(s))

Solution (Python):
S=input()
a=len(S)
print('x'*a)

Solution (Python):
s = input()
r=["x"]*len(s)
print("".join(r))

Solution (Python):
S = str( input() )

size = len(S)
print('x'*size)

Solution (Python):
S = input()
print('x'*len(S))

Solution (Python):
def main():
    s = input()
    ans = "x"*len(s)
    print(ans)
    return

if __name__=="__main__":
    main()

Solution (Python):
print(len(input()) * "x")

Solution (Python):

s = input().strip()

print('x' * len(s))

Solution (Python):
s = input()

print("x" * len(s))

Solution (Python):
S = input().strip()
n = len(S)
print("x"*n)

Solution (Python):
s = input()
print("x" * len(s))

Solution (Python):
S = input()

for i in range(len(S)):
    print("x", end="")

Solution (Python):
S=len(input())
print("x"*S)

Solution (Python):
s = str(input())
for i in range(len(s)):
    print("x",end ="")

Solution (Python):
s = input()

for i in range(len(s)):
    print("x", end="")
print()