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()
length = len(s)
ss = ''
for i in range(length):
    ss += 'x'

print(ss)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)

S = input()
l = len(S)
ans = ['x' for _ in range(l)]

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import calendar
import fractions
import itertools

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9

s = input().rstrip()
print("x" * len(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = str(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print("x" * L)

Submission status: Accepted

Solution code:
import math,itertools,fractions,heapq,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()
  x=len(s)

  ans=['x' for _ in range(x)]
  return ''.join(ans)

# main()
print(main())

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

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

print()

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

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

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
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()
     
def main():
    s = S()
    print('x' * len(s))

main()

Submission status: Accepted

Solution code:
Ss = input()

print('x'*len(Ss))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


S = input()

print('x' * len(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

s=input()
n=len(s)
D=["x"]*n
print(*D,sep="")

Submission status: Accepted

Solution code:
S = len(input())

print('x'*S)

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
X = input()

print("x" * len(X))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))


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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
import sys


def main():
    s = sys.stdin.readline().strip()

    a = []
    for _ in s:
        a.append('x')

    print(''.join(a))


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

lis = ["x"] * len(S)

print ("".join(lis))

Submission status: Accepted

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

    print('x' * n)


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

print('x'*len(ns()))

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:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

s = input()

print("x" * len(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


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


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

S = input()

print('x' * len(S))

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

S = sys.stdin.buffer.readline().decode().rstrip()
print( 'x' * len(S))

Submission status: Accepted

Solution code:
def read():
    S = str(input().strip())
    return S,

def solve(S):
    return 'x' * len(S)


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# ABC154b


def main():
    import sys
    sys.setrecursionlimit(10**6)
    # 再帰関数を使わない限りPypyで出すこと

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)


def solve(S: str):
    ret = 'x' * len(S)
    print(ret)
    return

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:
import sys, 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(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
l = len(S)
answer = 'x' * l
print(answer)

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 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 LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

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

def solve():
    S = input()
    ans = ""
    for moji in S:
        ans += "x"

    print(ans)

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
for i in range(len(S)):
    S[i]='×'
print(S)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(“x” * len(input()))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = int(input())
L = len[S]
for i in rnage(L):
    print(L)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
  string S;
  cin>>S;
  for(int i=0;i<S.length();i++){
    cout<<"x";
  }
  cout<<endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
s=input()

l=len(s)

for i in range(l):
  s[i]="x"
  
  
print(s)

Submission status: Runtime Error

Solution code:
s=input()

l=len(s)

for i in range(l):
  s[i]=x
  
  
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
mod = int(1e9+7)
def add(a, b):
    c = a + b
    if c >= mod:
        c -= mod
    return c

def main():
  	n = len(raw_input())
    ans = ''.join(['x' for _ in range(n)])
	print(ans)
    

main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

S_len = len(S)

print(x* S_len)

Submission status: Runtime Error

Solution code:
S,T=map(str, input().split())
A,B=map(int,input().split())
U=input()

if S==U:
  a=1
  b=0
else:
  a=0
  b=1

print(A-a,B-b)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
n=len(s)
ans=0
for i in range(n):
  ans.append("x")
print("",join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
sardine

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S=input()
print(S.replace("x"))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(‘x’*len(input()))

Submission status: Runtime Error

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

print(len(input()) * 'X)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
t = [x for i in range(len(s))]
print(*t)

Submission status: Runtime Error

Solution code:
S = input()
S.replace()

ans = []

for i in range(1,len(s)):
    ans.append("x")

print("".join(ans))

Submission status: Runtime Error

Solution code:
S = input()
S.replace()

ans = []

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

print("".join(ans))

Submission status: Runtime Error

Solution code:
list=list(input())
for s in list:
  s='x'
print(*list sep='')

Submission status: Runtime Error

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

print(x*S)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n-1):
	if a[i]==a[i+1]:
		print("NO")
		break
else:
	print("YES")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=raw_input()
print len(s)*x

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
l=len(s)
t=[]
for i in range(l):
  t.append(x)

n=''.join(t)
print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = st(input())
string = list(s)
cnt = sum(string)
print("x" * int(cnt))

Submission status: Runtime Error

Solution code:
s = st(input())
string = list(s)
cnt = sum(string)
print("x" * cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

get = input()
for i in range(len(get)):
    print("x".end="")

Submission status: Runtime Error

Solution code:
s = input()

a = x

print('a' * len(s))

Submission status: Runtime Error

Solution code:
s = input()

a = x

print('x' * len(s))

Submission status: Runtime Error

Solution code:
S = str(input())
result = []

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

result = ''.join(result)
print(result)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  string s;
  cin >> s;
  rep(i,s.size()) {
    s[i] = 'x';
  }
  cout << s << endl;
  return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(out)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,A,B=map(int,input().split())
rest = N-A-B
if A ==0:
    print(0)
elif N>A+B:
    answer = A + rest
    print(answer)
elif A<=N<=A+B:
    print(A)
elif A>=N:
    print(N)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

for i in len(s):
  print(x, '')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
mozi = str(input())
for i in mozi:
  i == chr(x)
  print(i)

Submission status: Runtime Error

Solution code:
import re
s = input()

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

Submission status: Runtime Error

Solution code:
s = input()
for i, c in enumerate(s):
  s[i] = 'x'
print(s)

Submission status: Runtime Error

Solution code:
s = input()
for c, i in enumerate(s):
  s[i] = 'x'
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main(){
    string S;
    cin >> S;
    for(int i = 0; i < S.size(); i++){
        cout << "x";
    }
    cout << endl;
}

Submission status: Runtime Error

Solution code:
S = input()

l = len(S)
K = ""
for x in l:
  K += x
  
print(K)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
count1 =0
count2 = 0
for i in a:
    if i%2==0:
        count1+=1
        if i%3==0 or i%5 == 0:
            count2+=1
    else:
        pass
if count1 == count2:
    print('APPROVED')
else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
    x=input()
    xx=[]
    if i in range(len(x)):
      xx.append("x")
    print(x)

Submission status: Runtime Error

Solution code:
x=input()
xx=[]
if i in range(len(x)):
  xx.append(x)
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() 
{
  string s;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    cout << "x";
  }

}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

ls = len(S)

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

print(ans)

Submission status: Runtime Error

Solution code:
S = input()

ls = len(S)

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int  ,int > pii;
typedef pair<ll  ,ll > pll;

const ll maxn =2e6;
const ll mod = 1e9+7;
const ld PI = 4 * atan((ld) 1);

#define pb(x) push_back(x);
#define endl '\n'
#define dokme(x) cout << x ;  return(0);
#define migmig ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_init freopen("input.txt", "r+", stdin); freopen("output.txt", "w+", stdout);
#define ms(x , y) memset(x , y , sizeof x);
ll pw(ll a, ll b) {
    return (!b ? 1 : (b & 1 ? a * pw(a * a % mod, b / 2) % mod : pw(a * a % mod, b / 2) % mod));
}

string s , t , u;
int a , b;

int main(){
    migmig
    cin >> s;
    for (int i = 0 ; i < s.size() ; i ++){
        cout << 'x';
    }


    return(0);
}


//When we hit our lowest point, we are open to the greatest change.
//If I try, I fail. If I don't try, I'm NEVER GOING TO GET IT.
//Sometimes, life is like this dark tunnel. You can't always see the light at the end of the tunnel. But if you just keep moving... you will come to a better place.
//It is important to draw wisdom from diffrent places. If you take it from only one place it becomes rigid and stale.

Submission status: Runtime Error

Solution code:
print("X" * len(input())

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s;
    cin >> s;
    rep(i,s.size())cout << 'x';
    cout << endl;
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
t=[]
for i in range(len(s)):
  t.sppend(x)
print(t)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;
public class main {
	public static void main (String[] args) {
		Scanner input = new Scanner(System.in);
		String w = input.next();
		int i;
		int n=w.length();
		for(i=0 ;i<n ;i++) {
			System.out.print("x");
		}		
	}

}

Submission status: Runtime Error

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

print(ans)

Submission status: Runtime Error

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

if U == S:
    A -= 1
elif U == T:
    B -= 1

print(A,B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
d=input()
k=len(d)
printf("x"*k)

Submission status: Runtime Error

Solution code:
S = input()
string = ""
num = len(S)
for x in num:
  string*="x"
print(string)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A,B)

Submission status: Runtime Error

Solution code:
S, T = input().split()
A, B = map(int, input().split())
U = input()
if U == S:    A -= 1
else: B -= 1
print(A, B)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input("Enter string")
for x in len(S):
  s.replace(x,"x")
print(S)

Submission status: Runtime Error

Solution code:
a=input()
A=len(a)
b=x
for i in A-1:
  b=b+'x'
print(b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=str(a)
c=list(b)
d=len(c)
r=1
while r<=d:
  c[r]="x"
  k=c.count("x")
  if k==d:
    e=",".join(c)
    e.replace(",","")
    print(e)
    break
  else:
    continue