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:
s=input()

le=len(s)

ans="x"

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin


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

main()

Submission status: Accepted

Solution code:
s = input()

ans = "x"*len(s)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = ""
for i in range(len(s)):
    ans += "x"
print(ans)

Submission status: Accepted

Solution code:
s = str(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))

print("x" * len(s))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
inputf = input

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = str(input())

print('x' * len(S))

Submission status: Accepted

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

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = []

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


print('x' * len(S))

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()
res =''
for _ in range(len(s)):
    res+='x'
print(res)

Submission status: Accepted

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

S = input()

length = len(S)

print('x'*length)

Submission status: Accepted

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

ans = ["x"] * l

print("".join(ans))

Submission status: Accepted

Solution code:
# 2020/02/09
# AtCoder Beginner Contest 154 - B

# Input
s = input()

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

# Output
print(ans)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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


# 最大公約数（ユークリッドの互除法）
# Python3.5 で math.gcd()が追加され、
# AtCoder環境と最新環境でパッケージが分かれてしまったので、自分で書いておく
def gcd(x, y):
    return x if y == 0 else gcd(y, x % y)


# 拡張ユークリッド互除法
# 正整数x, y について、a*x + b*y == gcd(x,y)なるa,bを返す。
# 特に、互いに素なるx, yについては a*x + b*y == 1 となる a, b。
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())

Submission status: Accepted

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

print(s)

Submission status: Accepted

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


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


# 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:
def main(s):
    return "x"*len(s)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B

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

Submission status: Accepted

Solution code:
import numpy as np

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

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

Submission status: Accepted

Solution code:
S = input()

L = len(S)

print("x"*int(L))

Submission status: Accepted

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

Submission status: Accepted

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

print("x"*ls)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

l = len(s)

print("x"*l)

Submission status: Accepted

Solution code:
S = str(input())
# A,B= map(int, input().split())
# H= list(map(int, input().split()))
print("x"*len(S))

Submission status: Accepted

Solution code:

S = input()

print("x" * len(S))

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

print(''.join(ans))

Submission status: Accepted

Solution code:
''' Hey stalker :) '''
INF = 10**10
def main():
    #print = out.append
    ''' 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
#from functools import reduce
import math
#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
out = []
get_int = lambda: int(input())
get_list = lambda: list(map(int, input().split()))
main()
#[main() for _ in range(int(input()))]
print(*out, sep='\n')

Submission status: Accepted

Solution code:
S=len(input())
print('x'*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:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    run()

Submission status: Accepted

Solution code:
s = len(input())
ans = "x"*s
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()

l = len(S)

print('x' * l)

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()
print('x'*(len(s)))

Submission status: Accepted

Solution code:
inputstr = input()

print('x' * len(inputstr))

Submission status: Accepted

Solution code:
X = input()

print("x"*len(X))

Submission status: Accepted

Solution code:
u = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8


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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str( input() )

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

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input().strip()

print('x' * len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

print("x"*n)

Submission status: Accepted

Solution code:
s = input()

s_len = len(s)
ans = 'x' * s_len
print(ans)

Submission status: Accepted

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

s = input()
l = []
for i in range(len(s)):
    l.append("x")
print("".join(l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def A():
    temp = input().split()
    S = temp[0]
    T = temp[1]
    temp = [int(i) for i in input().split()]
    A = temp[0]
    B = temp[1]
    U = input()
    if U == S:
        print(A-1, B)
    else:
        print(A, B-1)

def B():
    print('x'*len(input()))
    
B()

Submission status: Accepted

Solution code:
s = str(input().rstrip())

print('x' * len(s))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

print('x'*len(s))

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""




s = input()

a = len(s)-1


print("x"*a)

Submission status: Accepted

Solution code:
S=input()
L = len(list(S))
ans = ""

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

print(ans)

Submission status: Accepted

Solution code:
s=len(input())




print("x"*s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

n = len(s)

print("x" * n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = len(input())

print('x' *s )

Submission status: Accepted

Solution code:

import sys
import numpy as np
from collections import deque
from itertools import combinations
sys.setrecursionlimit(10**9)


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

    print(x)



if __name__ == "__main__":
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
S = input()

t = ""

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

print(t)

Submission status: Accepted

Solution code:
def repeat_x(n):
    if n == 0:
        return ""
    else:
        return "x"+repeat_x(n-1)
s = input()
print(repeat_x(len(s)))

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=str(input())
a=len(s)
print('x'*a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

s = input().strip()

print('x' * len(s))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

Submission status: Accepted

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

    print("x" * len(S))


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = IS()
	l = len(N)
	ans = ""
	for i in range(l):
		ans += 'x'
	print(ans)

main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    s = S()
    print("x" * len(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = len(input())

print(''.join( ['x'] * n))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import *
from collections import *
from fractions import gcd


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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    s = len(input())
    x = ['x']*s
    print(''.join(x))

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

out = ''
for s in S:
  out += 'x'
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key


yn = 'YNeos'
ynflg = False
cnt = 0
ans = None

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

def intinput():
    return int(input())

def mulinputs():
    return map(int,input().split())

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas



S = input()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

S=input()
s=""
for i in range(len(S)):
    s="".join((s,"x"))
print(s)

Submission status: Accepted

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

print("x" * count_s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

s = input().split()[0]

print('x'*len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

print('x'*len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def ifn(): return float(input()) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def fmn(): return map(float, input().split()) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD

S = input()

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

Submission status: Accepted

Solution code:
# s, t = input().split(" ")
# a, b = map(int, input().split())

# u = input()
# if s == u:
#     a -= 1
# else:
#     b -= 1

# print(a, b)
s = input()

a = len(s)

ans = "x" * a

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
S=input()
N=len(S)
ans=""
for i in range(N):
    ans+="x"

print(ans)

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
import bisect
import numpy as np
import math
import itertools
def main():
    S = input()
    print("x" * len(S))


    return 0
if __name__ == '__main__':
    main()

Submission status: Accepted

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

S = readline().strip()

print('x' * len(S))

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda x: [ni() for _ in range(x)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: stdin.readline().split()

s = ns()
n = len(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    a = ''
    for s in S:
        a += 'x'
    print(a)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = len(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve():
    return 'x'*len(input())

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = ans + 'x'

print(ans)

Submission status: Accepted

Solution code:
s = input()

ans = ["x"] * len(s)

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()
a = "x" * len(s)
print(a)

Submission status: Accepted

Solution code:
s = input()
ans = ['x' for _ in range(len(s))]
print(*ans, sep="")

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()
l = len(s)
ans = ""
for i in range(l):
    ans += "x"
print(ans)