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:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('b1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    S = read_str()
    print('x' * len(S))


main()

Submission status: Accepted

Solution code:
s = input()
lens = len(s)

print("x" * lens)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

L=a*'x'
print(L)

Submission status: Accepted

Solution code:
S = input()

ls = len(S)

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l = len(s)

p = "x"*l

print(p)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    return "x" * len(string)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, 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(list, 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)]
mod = 1000000007
inf = float('INF')

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


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

    sLen = len(s)

    s = 'x' * sLen

    print(s)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = len(input())

print('x' * l)

Submission status: Accepted

Solution code:
s=input()

a=len(s)

print('x'*a)

Submission status: Accepted

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

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:
s = input()
n = len(list(s))
l = ["x"] * n
r = "".join(l)
print(r)

Submission status: Accepted

Solution code:
len = len(input())

print('x' * len)

Submission status: Accepted

Solution code:
S = str(input())

print('x'*len(S))

Submission status: Accepted

Solution code:
import re
s = input()

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

Submission status: Accepted

Solution code:
print("".join(map(lambda x: "x", list(input().strip()))))

Submission status: Accepted

Solution code:
s = input()

s_len = len(s)

ans = 'x' * s_len

print(ans)

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 i in range(len(S)):
    X += "x"

print(X)

Submission status: Accepted

Solution code:
#abc154b
s=raw_input()
l=len(s)
print 'x'*l

Submission status: Accepted

Solution code:
print("x"*len(input().strip()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

length = len(S)

result = 'x'*length
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

b = "x"*a

print(b)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
from collections import deque

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

s = ns()
print("x"*len(s))

Submission status: Accepted

Solution code:

def main():
    s = input()
    for _ in range(len(s)):
        print('x',end='')

if __name__ == '__main__':
  	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# S,T = input().split()
# A,B = map(int, input().split())
S = input()
len_S = len(S)

ans = 'x'*len_S
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

# s = "hoge!\#"

import re
s=re.sub('[\s\S]', 'x',s)
print(s)

Submission status: Accepted

Solution code:
S=input()

n=len(S)
lit = 'x'*n
print(lit)

Submission status: Accepted

Solution code:
# B - I miss you...
print('x'*len(input()))

Submission status: Accepted

Solution code:
s = input()

import re
s=re.sub('[\s\S]', 'x',s)
print(s)

Submission status: Accepted

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial

sys.setrecursionlimit(10**7)
S = input()

print('x' * len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = input()
    print('x'*len(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import numpy as np
import collections
from functools import cmp_to_key
import heapq

##  input functions for me
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def rip(sep = ''):
    if sep == '' :
        return map(int, input().split()) 
    else: return map(int, input().split(sep))
def ria(sep = ''): 
    return list(rip(sep))
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()
##
def main():
    s = rs()
    t = ['x' for c in s]
    print("".join(t))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
print("".join(['x' for _ in range(len(s))]))

Submission status: Accepted

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

print("x"*n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip()
l = len(S)
print('x' * l)

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

Solution code:
#入力
S = str(input())

#出力
print('x'*(len(S)))

Submission status: Accepted

Solution code:
import re

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

Submission status: Accepted

Solution code:
s = len(input())

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

print(l)

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()

ans_list = ["x" for i in list(S)]
ans= "".join(ans_list)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(f)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

s = input()
ans = ['x' for _ in range(len(s))]
print(''.join(ans))

Submission status: Accepted

Solution code:
import sys

def main():

    # sys.stdin = open('input154b.txt')

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

l = len(S)

print("x" * l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
#input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines

# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np

def main():
	s=input()
	
	print("x"*len(s))
	
	
	
	
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

def solve(S: str):
    ans = ["x"] * len(S)
    print("".join(ans))


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=[i for i in input()]
print(len(x)*"x")

Submission status: Accepted

Solution code:
U=str(input())

l=len(U)
print("x"*l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print('')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import os

def main():
    s = sys.stdin.readline().strip()
    print('x' * len(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

for i in range(len(S)):
  if i==0:
    S="x"+S[1:]
  else:
    S=S[:i]+"x"+S[i+1:]
  
print(S)

Submission status: Accepted

Solution code:
S = input()

print(len(S)*'x')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
n=len(s)
x=""
for i in range(n):
    x=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 = len(s)
for i in range(len):
    print("x", end="")

Submission status: Accepted

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

Submission status: Accepted

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

print(p)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=str(input())

print('x'*len(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
s = input().replace("a","x").replace("b","x").replace("c","x").replace("d","x").replace("e","x").replace("f","x").replace("g","x").replace("h","x").replace("i","x").replace("j","x").replace("k","x").replace("l","x").replace("m","x").replace("n","x").replace("o","x").replace("p","x").replace("q","x").replace("r","x").replace("s","x").replace("t","x").replace("u","x").replace("v","x").replace("w","x").replace("y","x").replace("z","x")
print(s)

Submission status: Accepted

Solution code:
a = str(input())

b = len(a)

print("x"*b)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

str = 'x'

for i in range(len(S) - 1):
    str += 'x'

print(str)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
x_list = ["x"]*len(s)

print("".join(x_list))

Submission status: Accepted

Solution code:
string = input('')
for i in string:
    string = string.replace(i, 'x')
print(string)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import itertools
# import math
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

U = readline().decode('utf8').strip()

print('x'*len(U))

Submission status: Accepted

Solution code:
S = input()

ans = 'x' * len(S)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
for i in range(len(S)):
    S[i]='x'
print(*S, sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

print(s.replace('a','x').replace('b','x').replace('c','x').replace('d','x').replace('e','x').replace('f','x').replace('g','x').replace('h','x').replace('i','x').replace('j','x').replace('k','x').replace('l','x').replace('m','x').replace('n','x').replace('o','x').replace('p','x').replace('q','x').replace('r','x').replace('s','x').replace('t','x').replace('u','x').replace('v','x').replace('w','x').replace('y','x').replace('z','x'))

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

#output
s = len(S)
print("x"*s)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = str(input().rstrip('\n'))
    s = "x" * len(s)
    print(s)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
def solve():
    s = input()

    ans = ['x' for _ in range(len(s))]

    ans = ''.join(ans)
    print(ans)

def main():
    solve()
    pass

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=input()
for _ 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 = input()
x = ''

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

print('x' * l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
U = input()

a = 'x'
x = len(U)
print(a*x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=len(a)
c="x"
d=b*c
print(d)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B - I miss you...
def main():
    S = input().rstrip()
    print("x" * len(S))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = len(input())

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

Submission status: Accepted

Solution code:
S = input()
ans = ["x" for s in S]
print(*ans, sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#++++[>+++++[>++++++<-]<-]>,,[,>.<+][
import subprocess
args=['bf','Main.py']
subprocess.check_call(args)
#]

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = "x"*len(S)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import subprocess
args=['sed','s/./x/g']
subprocess.check_call(args)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
print("".join(["x" for x in a]))

Submission status: Accepted

Solution code:
import sys 

line = sys.stdin.readline().strip()
print("x"*len(line))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = len(input())

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

Submission status: Accepted

Solution code:
S=input()
word="S"
print(word.replace("S","x")*len(S))

Submission status: Accepted

Solution code:
S = len(input())

print('x' * S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
n=len(s)
a=['x']*n
print(''.join(a))

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

S = str(input().strip())

print('x' * len(S))

Submission status: Accepted

Solution code:
import re
char=input()
print(re.sub(".", "x", char))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
l = []

for i in s:
  i = 'x'
  i += i*(len(s)-1)
print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_data = input()

print('x'* len(input_data))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力された文字列をすべてxで置き換える

# 文字列の標準入力
s = input()
hoge = []

for i in range(len(s)):
    c = s[i]
    c = "x"
    hoge.append(c)

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

Submission status: Accepted

Solution code:
print(''.join('x' for i in input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = len(input())
cnt = ""
length = 0
a = "x"
for i in range(S):
    cnt = cnt + a
print(cnt)

Submission status: Accepted

Solution code:
import numpy as np
s=input()
mojisuu=len(s)
cre="xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx"
print(cre[:mojisuu])

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

# Input
long = len(str(input()))
X = ""

# Proccess
for i in range(long):
	X = X + "x"

# Output							
print(X)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 無限 #####
# f_inf = float('inf')

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	S = input()
	S = S[:-1]
	ans = ""
	for i in S:
		ans += "x"
 
	print(ans)

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
S = str(stdin.readline().rstrip())
x = str(stdin.readline().rstrip())
l = len(S)
print("x" * l)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input()).lower()
result = s.translate(str.maketrans({'a': 'x', 'b': 'x', 'c': 'x', 'd': 'x', 'e': 'x', 'f': 'x', 'g': 'x', 'h': 'x', 'i': 'x', 'j': 'x', 'k': 'x', 'l': 'x', 'm': 'x', 'n': 'x', 'o': 'x', 'p': 'x', 'q': 'x', 'r': 'x', 's': 'x', 't': 'x', 'u': 'x', 'v': 'x', 'w': 'x', 'y': 'x', 'z': 'x'}))
print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("x"*len(input()))

Submission status: Accepted

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

Submission status: Accepted

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

retName = ""
for i in range(length):
    retName += 'x'

print("{}".format(retName))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

output =''

for c in s:
    output = output + 'x'

print(output)

Submission status: Accepted

Solution code:
s = raw_input().strip()
l = ["x"] * len(s)
print ''.join(l)

Submission status: Accepted

Solution code:
import re
word = input()
print(re.sub(r'\w', 'x', word))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(''.join(a))

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

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

print(r)

Submission status: Accepted

Solution code:
s = list(input())

for e in s:
    print('x',end='')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline

def main():
    S=input()
    result='x'*len(S)
    return result

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
y=int(len(s))
a=[]
for i in range(y):
    a.append("x")
c="".join(a)
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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