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



Sample input:
sardine


Sample output:
xxxxxxx

Submission status: Accepted

Solution code:
a = input().split()

ans = 'x' * len(a[0])

print(ans)

Submission status: Accepted

Solution code:
s = input()

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

print(a)

Submission status: Accepted

Solution code:
ans=''
string=input()
string_l=len(string)

for w in range(string_l):
    ans=ans+'x'
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
s=str(input())
t=[]
for i in range(len(s)):
  t.append('x')
u=''.join(t)
print(u)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def change(x):
  return "x"

a = input()
v = map(change, a)
print(''.join(list(v)))

Submission status: Accepted

Solution code:
S = input()
newS =""

for i in S:
  newS+='x'

print(newS)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import re
s = input()
print(re.sub('[a-z]', 'x', s))

Submission status: Accepted

Solution code:
s = input().split()
out=''
for i in range(len(s[0])):out+='x'
print(out)

Submission status: Accepted

Solution code:
import numpy as np

a = list(input())
a = np.array(a)
i =0
a
while i < a.size:
    a[i] = 'x'
    print(a[i], end ='')
    i = i +1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
len_s = len(s)

ans = []
for i in range(0,len_s):
  ans.append('x')
print(''.join(ans))

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def b():
    s = input()
    n = len(s)
    ss = ""
    for i in range(n):
        ss = ss + "x"
    return ss
print(b())

Submission status: Accepted

Solution code:
print ('x' * len(raw_input()))

Submission status: Accepted

Solution code:
s = input()
suu = len(s)
xx = ''

for n in range(1,suu+1):
    xx = xx+'x'
print(xx)

Submission status: Accepted

Solution code:
S = input()
re = ''
for i in S:
    re += 'x'
print (re)

Submission status: Accepted

Solution code:
S = input()
out = ""
for s in S:
    out = out + "x"
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    S = input()
    ans = ['x' for _ in range(len(S))]
    print(''.join(ans))


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
S = input()
b = []
for i in range(len(S)):
    b = 'x' * len(S)

print(b)

Submission status: Accepted

Solution code:
a=len(input())
b='x'*a
print(b)

Submission status: Accepted

Solution code:
s = input()

count = len(s)

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

Submission status: Accepted

Solution code:
S = input()
X = ''
for s in range(len(S)):
    X += 'x'
print(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S=input()

len_S = len (S)

A=""
for i in range(len_S):
    A+='x'

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S_len = len(input())
print("x" * S_len)

Submission status: Accepted

Solution code:
#At coder 2020/2/9 B

# スペース区切りの数の入力
S = input()

L=len(S)
A='x'
for ii in range(L-1):
    A=str(A)+'x'

print(A)

Submission status: Accepted

Solution code:
def main():
  s = input()
  ans = 'x'
  length = len(s)
  print(ans*length)

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

Solution code:
S = list(input())
for i in range(len(S)):
    S[i] = "x"
print("".join(S))

Submission status: Accepted

Solution code:
string = input()
count = len(string)

string_li = []

for i in range(count):
    string_li.append('x')

string_x = "".join(string_li)

print(string_x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = len(input())
ans = ["x"] * s
print(''.join(ans))

Submission status: Accepted

Solution code:
s = input()
list00 = ['x']*len(s)
s_n = "".join(list00)
print(s_n)

Submission status: Accepted

Solution code:
s = input()

result = ''

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

Submission status: Accepted

Solution code:
import sys
f = sys.stdin
S = f.readline()[:-1]
print(''.join(['x']*len(S)))

Submission status: Accepted

Solution code:
S=input()


print('x'*len(S))

Submission status: Accepted

Solution code:
S = input()

length = len(S)

print("x" * length)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
X = ''
for _ in range(len(S)):
    X += 'x'
print(X)

Submission status: Accepted

Solution code:
a = input()
b = len(a)
c = ""
for i in range(b):
    c = c + "x"
print(c)

Submission status: Accepted

Solution code:
string = input()
length = len(string)

output = "x"*length

print(output)

Submission status: Accepted

Solution code:


if __name__ == "__main__":
    S = input()
    i = len(S)
    ret = "x" * i
    print(ret)

Submission status: Accepted

Solution code:
args = input()

print("x"*len(args))

Submission status: Accepted

Solution code:
s = input()

s_len = len(s)

print("x" * s_len)

Submission status: Accepted

Solution code:
#cotest_temp
s = input()
ans = ""
for i in range(len(s)):
    ans = ans + "x"

print(ans)

Submission status: Accepted

Solution code:
in_string = input()
out_string = ["x"]*len(in_string)
print("".join(out_string))

Submission status: Accepted

Solution code:
S = input()

s_count = len(S)
result = ''
for v in range(s_count):
  result = result + 'x'

print(result)

Submission status: Accepted

Solution code:
len_i = len(input())
o = ''
for n in range(0, len_i):
    o += 'x'
print(o)

Submission status: Accepted

Solution code:
a = list(map(str, input().split()))
b = len(a[0])
c = "x" * b
print(c)

Submission status: Accepted

Solution code:
# python3
# -*- coding: utf-8 -*-
import sys
import math
#from math import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
sys.setrecursionlimit(1000000000)


def lcm(a, b):
    return (a * b) // gcd(a, b)


# main
S = input()
print('x' * len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Stringの場合
s = input()
l = len(s)
output=""
for i in range(l):
    output += "x"
print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
s_len = len(S)
result = ""
for i in range(s_len):
    result += "x"
print(result)

Submission status: Accepted

Solution code:
import re

a = str(input())
print(re.sub('[a-z]', 'x', a))

Submission status: Accepted

Solution code:
s = str(input())

length = len(s)

res = ''


print('x' * length)

Submission status: Accepted

Solution code:
S=input()
x=""

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    u = lines[0]

    return (u,)


def solve(u):
    
    result = ''.join(['x' for e in u])

    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
memo = len(S)
result = ''
for i in range(0,memo,1):
  result += 'x'
print(result)

Submission status: Accepted

Solution code:
a = input()
b = ''
for k in range(len(a)):
  b += 'x'
print(b)

Submission status: Accepted

Solution code:
S = str(input())
ans = len(S)

print('x'*ans)

Submission status: Accepted

Solution code:
s = input()
x = ['x']*len(s)
print(''.join(x))

Submission status: Accepted

Solution code:
S = input()

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

print(answer)

Submission status: Accepted

Solution code:
import re
s = input()

sst = re.sub(r'[a-z]', "x", s)
print(sst)

Submission status: Accepted

Solution code:
def Main(S):
    N = len(S)
    return "".join(['x' for _ in range(N)])

def main():
    S = str(input())
    print(Main(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
class InputString():
    def __init__(self, S):
        self.S = S
        self.input_length = len(S)
        self.output = ""

    def toX(self):
        for _ in range(self.input_length):
            self.output += "x"


S = input()
input_string = InputString(S)
input_string.toX()
print(input_string.output)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
input_line = input()
ChangeS = ""
for i in range(len(input_line)):
  ChangeS = ChangeS + "x"
print(ChangeS)

Submission status: Accepted

Solution code:
slist = list(raw_input())

snum = len(slist)

ret = ""

for i in range(len(slist)):
    ret = ret + 'x'

print ret

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = list(input())
print('x' * len(string))

Submission status: Accepted

Solution code:

s = input()
num = len(s)

print(num*"x")

Submission status: Accepted

Solution code:
s = input()
s = list(s)
for i in range(len(s)):
  s[i] = 'x'
s = ''.join(s)

print(s)

Submission status: Accepted

Solution code:
s = input()
o = ['x' for _ in s]
print(''.join(o))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
print("x"*len(s))

Submission status: Accepted

Solution code:
# B - I miss you...

s=input()
len=len(s)

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

Submission status: Accepted

Solution code:
s = input()
l = len(s)
rep = ['x' for _ in range(l)]
print(''.join(rep))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

str_len = len(S)

ans = ''

for s in range(str_len):
    ans += 'x'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = 'x'
for ii in range(len(S)-1):
  ans = ans + 'x'

print(ans)

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
S = input()
N = len(S)
print('x'*N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
x = ['x']*len(S)
X = ''.join(x)
print(X)

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
n = len(S)
print("x" * n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
L=str(len(S))
L=int(L)-1
ans='x'
c=0
while not (int(c)==int(L)):
  ans=ans+'x'
  c=c+1
print(ans)

Submission status: Accepted

Solution code:
S = input()

for n in S:
    print('x', end="")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

print('x' * l)

Submission status: Accepted

Solution code:
a=input()
b=''
for i in range(len(a)):
  b+='x'

print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = ''
for _ in S:
    ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
moji = str(input())

print("x" * len(moji))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()
n = len(inp)

def print_n_word(word,n):
    result = ""
    for i in range(n):
        result = result+word
    return result


print(print_n_word("x",n))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
P=input()
print("x"*len(P))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict

IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())

u=input()

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


N=int(100005)
a=[int(0) for i in range(N)]

Submission status: Accepted

Solution code:
def main():
  T = str(input())
  res = ""
  for t in T:
    res += "x"
  print(res)
          
if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
s = input()
t = list(s)
k = ""

for i in range(0, len(t)):
  k = k + "x"

print(k)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=input()

print("x"*len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input())
out = ""
for i in a:
    out = out + "x"

print(out)

Submission status: Accepted

Solution code:
S = input()

S_size = len(S)

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

Submission status: Accepted

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

    return

resolve()

Submission status: Accepted

Solution code:
S = input()
S_new = ''

for char in S:
    S_new += 'x'
print(S_new)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

s = str(input())

len_s = len(s)

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
lengs = len(S)


ans = ""
ans = str(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = str(input())
    x_moji = "x"*len(S)
    print(x_moji)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

num = len(s)

print("x" * num)

Submission status: Accepted

Solution code:
S = input()

length_S = len(S)

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

Submission status: Accepted

Solution code:
s = str(input())

ans = ''

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def conv(n):
    ans = ''
    for i in range(n):
        ans += 'x'
    return  ans

if __name__ == "__main__":
    s = input()
    print(conv(len(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
moji = list(input())
res = ""

for i in range(len(moji)):
  res = res + "x"

print(res)

Submission status: Accepted

Solution code:
S = input()
nums = len(list(S))
anslist = ['x']*nums
ans = ''
for a in anslist:
    ans += a
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
len = len(S)
moji = ""

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

print(moji)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()


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


print(mojiretsu)

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

Solution code:
x=input()
print('x'*len(x))

Submission status: Accepted

Solution code:
u=str(input())
a = ["x" for i in range(len(u))]
print(''.join(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
t=['x']*len(s)
print(''.join(t))

Submission status: Accepted

Solution code:
N = len(input())
Ans = "x"*N
print(Ans)

Submission status: Accepted

Solution code:
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    if type(s) != type('str'):
        s=str(s)

    sys.stderr.write(s+'\n')
    return

def main():
    s = input()
    print('x' * (len(s)-1))
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=str(input())
L=len(S)
X="x"
for i in range(L-1):
    X+="x"
print(X)

Submission status: Accepted

Solution code:
S=input()
X="x"
for i in range(len(S)-1):
    X=X+"x"
print(X)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S = input()
out = "";
for i in range(len(S)):
    out += "x"
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
print(''.join(['x'for s in S]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()

    print("x" * len(S))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = str(input())

S_len = len(S)

X = ""

for i in range(S_len):
  X += "x"

print(X)

Submission status: Accepted

Solution code:
s = input()

l = len(s)

v = 'x'*l

print(v)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

t = ""
l = len(s)

for i in range(l):
    t += "x"

print(t)

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    s = input()
    print("x"*len(s))
    return

#Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
s = input()
ans = ''
for i in s:
    ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
S = input()
for s in S:
    print("x",end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s_cnt = len(s)

ans = ''
for _ in range(s_cnt):
  ans += 'x'

print(ans)

Submission status: Accepted

Solution code:
S=str(input())
p=len(S)
t=[]
for i in range(p):
  t.append('x')
q=''.join(t)
print(q)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(str, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


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


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    S, T= LS()
    A,B= LI()
    U= input().rstrip()



    if(S==U):
        print(A-1,B)
    else:
        print(A,B-1)


    
    return

# B


def B():
    A=input().rstrip()
    ans='x'
    for i in range(len(A)-1):
        ans+='x'
    print(ans)
        
    


    return

# C


def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def C():
    N, M = LI()
    P=[]
    S=[]
    count=set([])
    ans=[0]*1000000
    realans=0
    for i in range(M):

        p,s=input().split()
        p=int(p)
        if s=='AC':
            realans+=ans[p]
            count.add(p)
            ans[p]=0
        if s=='WA' and p not in count:
            
            ans[p]+=1
  


    
    print(len(count),realans)
    

        


        

# D


def D():

    H, W= LI()
    S=[]
    d=0
    for i in range(H):
        tmp=input().rstrip()
        c=0
        for j in tmp:
            if '.'==j:
                S.append(d*100+c)
            c+=1
        d+=1
    print(S)



    return

# E


def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':

    B()

Submission status: Accepted

Solution code:
def main():
    A=input()
    print(len(A)*"x")
    

    
main()

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
s = list(input())

for i in range(len(s)):
  s[i] = 'x'

print(''.join(map(str,s)))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S = input()
print("x"*len(S))

Submission status: Accepted

Solution code:
S = list(str(input()))

for i in range(len(S)):
    S[i] = "x"
print("".join(S))

Submission status: Accepted

Solution code:
S = str(input())

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

print(ans)

Submission status: Accepted

Solution code:
s = input()
ans = 'x'*len(s)

print(ans)

Submission status: Accepted

Solution code:
S = list(input())

for s in range(len(S)):
  S[s] = 'x'
  
print(''.join(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
ans = ''
for s in S:
  ans += 'x'
print(ans)

Submission status: Accepted

Solution code:
S = input()
ans = ""
for _ in range(len(S)):
    ans += "x"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h=input()

ans = len(h)

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

s = input()

s_c = 'x' * len(s)

print(s_c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().rstrip()
print('x'*len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(a)

Submission status: Accepted

Solution code:
s = input()

l = len(s)

print("x" * l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
U = str(input())
l = len(U)
x = 'x'
print(x * l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(''.join(['x'] * len(list(input()))))

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

S = read_str()

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

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

Submission status: Accepted

Solution code:
S = input()
a = ""
for i in S:
    a += 'x'
print(a)

Submission status: Accepted

Solution code:
#import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

S = input()

ans = 'x' * len(S)

print(ans)

Submission status: Accepted

Solution code:
S = input()
x = len(S)

output = ''.join(str("x") for n in range(x))
print(output)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import re

S = input()

print( re.sub(r'[a-z]', 'x' , S ) )

Submission status: Accepted

Solution code:
s=input()
ans=[]
for i in range(len(s)):
  ans.append('x')
print(''.join(ans))

Submission status: Accepted

Solution code:
input_str = input()
print("x" * len(input_str))

Submission status: Accepted

Solution code:
# abc 154
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

S = read().strip().decode("utf-8")

answer = "".join(["x" for _ in list(S)])
print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
content = input()
length = len(content)
temp = "x" * length
print(temp)

Submission status: Accepted

Solution code:
dummy = input()
out = ""
for i in range(len(dummy)):
    out += "x"
print(out)

Submission status: Accepted

Solution code:
input_S = input()
 

length_S = len(input_S)

result=[]
for i in range(length_S):
    result.append("x")


print(''.join(result))

Submission status: Accepted

Solution code:
s=input()
ans=""

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

print(ans)

Submission status: Accepted

Solution code:
S = input().rstrip().split(' ')[0]
st = ""
for i in range(len(S)):st+="x"
print(st)

Submission status: Accepted

Solution code:
S = str(input())

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

print(ans)

Submission status: Accepted

Solution code:
u=input()
s=""
for idx in range(len(u)):
    s+="x"
print(s)

Submission status: Accepted

Solution code:
s = input()
i = len(s)
ss = ''
for _ in range(i):
	ss += 'x'
print(ss)