Problem:


Score : 100 points

Problem Statement

You are given an integer K.
Print the string obtained by repeating the string ACL K times and concatenating them.

For example, if K = 3, print ACLACLACL.

Constraints

1 \leq K \leq 5

All values in input are integers.

Input

Input is given from Standard Input in the following format:

K

Output

Print the string obtained by repeating the string ACL K times and concatenating them.

Sample Input 1

3

Sample Output 1

ACLACLACL



Sample input:
3


Sample output:
ACLACLACL

Submission status: Accepted

Solution code:
k=int(input())
for i in range(k):
    print("ACL", end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
for _ in range(k):
  print("ACL",end='')

Submission status: Accepted

Solution code:
K = int(input())
ans = ""
for _ in range(K):
  ans += "ACL"
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
if  K==1:
	print("ACL")
elif K==2:
    print("ACLACL")
elif K==3:
    print("ACLACLACL")
elif K==4:
    print("ACLACLACLACL")
elif K==5:
    print("ACLACLACLACLACL")

Submission status: Accepted

Solution code:
N = int(input())
for i in range(N):
    print("ACL",end="")

Submission status: Accepted

Solution code:
k = int(input())
print(k * "ACL")

Submission status: Accepted

Solution code:
k=int(input())
ans="ACL"*k
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
ans = ""
for i in range(K):
    ans += "ACL"
print(ans)

Submission status: Accepted

Solution code:
k = int(input())

l = []
for i in range(k):
    l.append('ACL')

print(''.join(l))

Submission status: Accepted

Solution code:
k = int(input())
i = 1
ans = "ACL"
while i < k:
    ans += "ACL"
    i += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
for i in range(k):
  print('ACL',end='')

Submission status: Accepted

Solution code:
K = int(input())
string = "ACL"
print(string * K)

Submission status: Accepted

Solution code:
k = int(input())

if k == 1:
    print("ACL")
if k == 2:
    print("ACLACL")
if k == 3:
    print("ACLACLACL")
if k == 4:
    print("ACLACLACLACL")
if k == 5:
    print("ACLACLACLACLACL")

Submission status: Accepted

Solution code:

s = int(input())
print("ACL" * s)

Submission status: Accepted

Solution code:
k=int(input())
r = ''
for i in range(0, k):
  r += 'ACL'
  
print(r)

Submission status: Accepted

Solution code:
def solve():
    K = int(input())

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
K = int(input())
con = ''
for i in range(K):
  con += 'ACL'
print(con)

Submission status: Accepted

Solution code:
n = int(input())
blank = ""
acl = "ACL"

for i in range(n):
    blank += acl
print(blank)

Submission status: Accepted

Solution code:
a=int(input())
b=[];m=[]
for c in range(a):
    d="ACL"
    b.append(d)
m=''.join(b)
print(m)

Submission status: Accepted

Solution code:
k = int(input())
for i in range(k):
  print("ACL",end="")

Submission status: Accepted

Solution code:
n = int(input())
ans = ''
for i in range(n):
    ans += 'ACL'
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
s="ACL"
print(s*k)

Submission status: Accepted

Solution code:
k=int(input())
x=""
for i in range(k):
    x+="ACL"
print(x)

Submission status: Accepted

Solution code:
print(*['ACL']*int(input()),sep='')

Submission status: Accepted

Solution code:
N=int(input())
u="ACL"
print(u*N)

Submission status: Accepted

Solution code:
n = input()
for i in range(int(n)):
  print('ACL', end='')

Submission status: Accepted

Solution code:
import sys

a = int(sys.stdin.readline().strip())

print("ACL" * a)

Submission status: Accepted

Solution code:
k = int(input())
ans = ''
for i in range(k):
    ans += 'ACL'
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
s="ACL"
r=k*s
for j in range(len(r)):
  print(r[j],end="")

Submission status: Accepted

Solution code:
K = int(input())
out = "ACL" *  K
print(out)

Submission status: Accepted

Solution code:
def acl(k):
    s = "ACL"*k
    return s
k = int(input())
print(acl(k))

Submission status: Accepted

Solution code:
N = int(input())
ans = "ACL"*N
print(ans)

Submission status: Accepted

Solution code:
#a
k=int(input())
ans=[]
for i in range(k):
    ans.append('ACL')
a=''.join(ans)
print(a)

Submission status: Accepted

Solution code:
import sys
s = 'ACL'
n = int(sys.stdin.readline().rstrip("\n"))
print(s*n)

Submission status: Accepted

Solution code:
k = int(input())
str = ''
for _ in range(k):
  str += 'ACL'
print(str)

Submission status: Accepted

Solution code:
k = int(input())
string =''
for i in range(k):
    string += 'ACL'

print(string)

Submission status: Accepted

Solution code:
n=int(input())
w="ACL"
print(w*n)

Submission status: Accepted

Solution code:
t=int(input())
s="ACL"
print(t*s)

Submission status: Accepted

Solution code:
K = int(input())

a = ""

for i in range(K):
    a += "ACL"

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
  k=int(input())
  print('ACL'*k)

Submission status: Accepted

Solution code:
K=int(input())
A=''

for i in range(K):
    A+='ACL'
print(A)

Submission status: Accepted

Solution code:
S = int(input())
R = "ACL"

  
print(R * S)

Submission status: Accepted

Solution code:
K = int(input())

ans = ''
for i in range(K):
  ans += 'ACL'
  i += 1
  
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
if K == 1:
    print('ACL')
elif K == 2:
    print('ACLACL')
elif K == 3:
    print('ACLACLACL')
elif K == 4:
    print('ACLACLACLACL')
elif K == 5:
    print('ACLACLACLACLACL')

Submission status: Accepted

Solution code:
K = int(input())
string = 'ACL'
for i in range(K - 1):
    string = string + 'ACL'

print(string)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# from typing import *


# def solve(K: int) -> str:
def solve(K):
    return "ACL" * K


# generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
def main():
    K = int(input())
    a = solve(K)
    print(a)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = int(input())
s = 'ACL'
for i in range (K - 1):
    s = s + 'ACL'
print(s)

Submission status: Accepted

Solution code:
K = int(input())

print("ACL"*K)

Submission status: Accepted

Solution code:
def main():
    base = "ACL"
    print(base * int(input()))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
a=("")
for _ in range(n):
    a=a+"ACL"
print(a)

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    string=""
    n = int(input())
    for i in range(n):
        string+="ACL"
    print(string)


if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
"""
ACL0926_A
"""

k=int(input())
acl='ACL'

for i in range(0,k-1):
    acl += 'ACL'
    
print(acl)

Submission status: Accepted

Solution code:
k = int(input())
l = []
for i in range(k):
    l.append('ACL')

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

Submission status: Accepted

Solution code:
n = int(input())
s = ""
for i in range(n):
  s += "ACL"
print(s)

Submission status: Accepted

Solution code:
k=int(input())
for i in range(0,k) :
    print("ACL",end='')

Submission status: Accepted

Solution code:
K = int(input())
a = ""
for i in range(K):
  a+="ACL"
print(a)

Submission status: Accepted

Solution code:
k = int(input())
X= "ACL"

print(X*k)

Submission status: Accepted

Solution code:
K = int(input())

result = ''

for _ in range(K):
    result += 'ACL'

print(result)

Submission status: Accepted

Solution code:
K = input()
ALC = ""
for i in range(int(K)):
    ALC += "ACL"
print(ALC)

Submission status: Accepted

Solution code:
K=int(input())
X=""
for i in range(K):
    X+="ACL"

print(X)

Submission status: Accepted

Solution code:
k = int(input())
word = []
for i in range(k):
    word.append('ACL')

print(''.join(word))

Submission status: Accepted

Solution code:
k = int(input())
S = ''
for _ in range(k):
    S += 'ACL'
print(S)

Submission status: Accepted

Solution code:

def main():
    N = int(input())
    print("ACL" * N)


main()

Submission status: Accepted

Solution code:
K = int(input())
ans = "ACL"*K
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
a = "ACL"
ans = ""
for i in range(K):
    ans += a
print(ans)

Submission status: Accepted

Solution code:
K=input()
s="ACL"*int(K)
print(s)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from math import gcd
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gcd
from operator import mul
from functools import reduce
from pprint import pprint


sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().rstrip().split()
def S(): return sys.stdin.readline().rstrip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]

mod=10**9+7

print("ACL"*I())

Submission status: Accepted

Solution code:
k = int(input())
l = list()
for i in range(k):
    l.append("ACL")
print("".join(l))

Submission status: Accepted

Solution code:
k = int( input() )
#print( k )


ans = ""
for i in range( k ):
    ans = ans + "ACL"


print( ans )

Submission status: Accepted

Solution code:
n = int(input())
for i in range(n):
  print("ACL", end = "")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Sep 26 21:02:43 2020

@author: liang
"""
K = int(input())
ans = ""

for i in range(K):
    ans += "ACL"

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

ans = 'ACL'

for _ in range(n-1):
  ans = ans + 'ACL'

print(ans)

Submission status: Accepted

Solution code:
K = int(input())

for i in range(K):
    print('ACL', end='')

print('')

Submission status: Accepted

Solution code:

a=int(input())


b=''
for i in range(a):
    b=b+'ACL'


print(b)

Submission status: Accepted

Solution code:
#
# ACL_A
#
n = input()
n = int(n)

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

Submission status: Accepted

Solution code:
for _ in range(int(input())):
  print("ACL",end="")
print("")

Submission status: Accepted

Solution code:
n = int(input())
a = ["ACL"]*n
print(''.join(a))

Submission status: Accepted

Solution code:
k = int(input())
lists = []
for i in range(k):
    lists.append("ACL")
ans = "".join(lists)
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
A = ""
for i in range(K):
  A = A + "ACL"
print(A)

Submission status: Accepted

Solution code:
K = int(input())

output = ""

for i in range(K):
    output += "ACL"

print(output)

Submission status: Accepted

Solution code:
K = int(input())

S = "ACL"

for i in range(K-1):
  S += "ACL"
  
print(S)

Submission status: Accepted

Solution code:
a = int(input())
s = ['ACL']
w =[]
for i in range(a):
    w += s
print(''.join(w))

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():
    k = ri()
    print("ACL"*k)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
S = "ACL"

for i in range(K - 1):
    S += "ACL"

print(S)

Submission status: Accepted

Solution code:
for i in range(int(input())):
  print('ACL', end ='')
print()

Submission status: Accepted

Solution code:
K = int(input())
a=''
for i in range(K):
  a = a + 'ACL'
print(a)

Submission status: Accepted

Solution code:
n = int(input())
s = "ACL"
k = ""
for i in range(n):
  k+=s
print(k)

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline().strip())
for idx in range(n):
    sys.stdout.write('ACL')
sys.stdout.write('\n')

Submission status: Accepted

Solution code:
K=int(input())

s=''
for i in range(K):
  s=s+'ACL'
  
print(s)

Submission status: Accepted

Solution code:
N=int(input())
base = ["ACL"]*N
print("".join(base))

Submission status: Accepted

Solution code:
K = int(input())

for i in range(K):
    print("ACL", end='')
print()

Submission status: Accepted

Solution code:
k = int(input())
if k == 1:
    print('ACL')
elif k == 2:
    print('ACLACL')
elif k == 3:
    print('ACLACLACL')
elif k == 4:
    print('ACLACLACLACL')
else:
    print('ACLACLACLACLACL')

Submission status: Accepted

Solution code:
k = int(input())
acl = "ACL"
print(acl*k)

Submission status: Accepted

Solution code:
N = int(input())
ans = "ACL" * N
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
l=["ACL"]*k
print("".join(l))

Submission status: Accepted

Solution code:
x=int(input())
print("ACL"*x)

Submission status: Accepted

Solution code:
K = int(input())
print( K * "ACL")

Submission status: Accepted

Solution code:
N = input()

s = ''

for i in range(int(N)):
    s += 'ACL'

print(s)

Submission status: Accepted

Solution code:
num = int(input(""))
ans = num*"ACL"
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
print(k * 'ACL')

Submission status: Accepted

Solution code:
K = int(input())
ans = "ACL" * K
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
print("ACL"* k)

Submission status: Accepted

Solution code:
K=int(input())
print("ACL"*K)

Submission status: Accepted

Solution code:
K = int(input())
stringa = str('ACL')
for i in range(K-1):
    stringa = stringa + str('ACL')

print(stringa)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
k = 'ACL'
print(k*n)

Submission status: Accepted

Solution code:
import sys
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data) 

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

n = I()
print('ACL' * n)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    K = int(input())
    print("ACL" * K)


main()

Submission status: Accepted

Solution code:
k = int(input())
answer = ""

for i in range(k):
    answer = answer + "ACL"

print(answer)

Submission status: Accepted

Solution code:
k=int(input())
a= 'ACL'
b=''
for i in range(k):
    b+=a
print(b)

Submission status: Accepted

Solution code:
#A
n = int(input())
for i in range(n):
    print("ACL",end="")

Submission status: Accepted

Solution code:
a=int(input())

b='ACL'
print(b*a)

Submission status: Accepted

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

#import
#import math
#import numpy as np
K = int(input())
#= map(int, input().split())
#= list(map(int, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= [int(input()) for _ in range(N)]
#= {i:[] for i in range(N)}

t = "ACL" * K

print(t)

Submission status: Accepted

Solution code:
K = int(input())
ACL = "ACL"
S = ""
for i in range(K):
    S = S + ACL
print(S)

Submission status: Accepted

Solution code:
K = int(input())
S = 'ACL'
for i in range(K-1):
    S = S + 'ACL'
print(S)

Submission status: Accepted

Solution code:
n = int(input())
s = ''
for i in range(n):
  s += 'ACL'
print(s)

Submission status: Accepted

Solution code:
K = int(input())
A = ""
for i in range(K):
  A += "ACL"
  
print(A)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
ss = ''

# 文字列の入力
s = 'ACL'

for i in range(a):
    ss += s
# 出力
print("{}".format(ss))

Submission status: Accepted

Solution code:
K = int(input())
m = 'ACL'
n = m * K
print(n)

Submission status: Accepted

Solution code:
k = int(input())
a = "ACL"
ans =""
for i in range(k):
    ans = ans+a

print(ans)

Submission status: Accepted

Solution code:
# @oj: atcoder
# @id: hitwanyang
# @email: 296866643@qq.com
# @date: 2020-09-26 19:47
# @url:
import sys,os
from io import BytesIO, IOBase
import collections,itertools,bisect,heapq,math,string
from decimal import *
# region fastio

BUFSIZE = 8192

BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# ------------------------------
## 注意嵌套括号!!!!!!
## 先有思路,再写代码,别着急!!!
## 先有朴素解法,不要有思维定式,试着换思路解决
def main():
    k=int(input())
    print (k*"ACL")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())

a="ACL"
for i in range(N-1):
    a+="ACL"    
print(a)

Submission status: Accepted

Solution code:
k = int(input())

ans = ''
for i in range(k):
    ans += 'ACL'
print(ans)

Submission status: Accepted

Solution code:
k=int(input())
n='ACL'*k
print(n)

Submission status: Accepted

Solution code:
s=''
for i in range(int(input())):
  s += 'ACL'
print(s)

Submission status: Accepted

Solution code:
K = int(input())
ans = ""
for p in range(K):
    ans += "ACL"

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A='ACL'

for i in range(N-1):
    A+='ACL'

print(A)

Submission status: Accepted

Solution code:
t=int(input())
str1="ACL"
str2=""
for i in range(0,t):
  str2=str2[0:]+str1[0:]
print(str2)

Submission status: Accepted

Solution code:

def resolve():
  N = int(input())

  for _ in range(N):
    print("ACL", end="")
  print("")

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
K = int(input())

str = "ACL"
ans = ""

for i in range(K):
    ans += str

print(ans)

Submission status: Accepted

Solution code:
k = int(input())
s = "ACL"
print(s*k)

Submission status: Accepted

Solution code:
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
import math
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li():  return list(mi())
 
def dmain():
    sys.setrecursionlimit(1000000)
    threading.stack_size(1024000)
    thread = threading.Thread(target=main)
    thread.start()
    
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list  m = [x[:] for x in mark] .. Avoid Using Deepcopy
 
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1] 
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
 
def ceil(x,y):
    if x%y==0:
        return x//y
    else:
        return x//y+1
 
def powerMod(x,y,p):
    res = 1
    x %= p
    while y > 0:
        if y&1:
            res = (res*x)%p
        y = y>>1
        x = (x*x)%p
    return res
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
    
def isPrime(n) : # Check Prime Number or not 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True
 
 
 
def read():
    sys.stdin  = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
 
def main():

    
    

    #for _ in range(ii()):
    n = int(input())
    print(n * 'ACL')
    
    


# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()
    #dmain()
 
# Comment Read()

Submission status: Accepted

Solution code:
K=int(input())

ans='ACL'*K

print(ans)

Submission status: Accepted

Solution code:
import sys     
import math as mt
import bisect
input=sys.stdin.readline
#t=int(input())
t=1
def ncr_util():
    inv[0]=inv[1]=1
    fact[0]=fact[1]=1
    for i in range(2,300001):
        inv[i]=(inv[i%p]*(p-p//i))%p
    for i in range(1,300001):
        inv[i]=(inv[i-1]*inv[i])%p
        fact[i]=(fact[i-1]*i)%p
def solve():
    s='ACL'
    for i in range(k):
        print(s,end="")
    print()    
for _ in range(t):
    k=int(input())
    #n,k=(map(int,input().split()))
    #n1=n
    #a=int(input())
    #b=int(input())
    #a,b,c,r=map(int,input().split())
    #x2,y2=map(int,input().split())
    
    #n=int(input())
    #s=input()
    #s1=input()
    #p=input()
    #l=list(map(int,input().split()))
    #l2=list(map(int,input().split()))
    #l=str(n)
    #l.sort(reverse=True)
    #l2.sort(reverse=True)
    #l1.sort(reverse=True)
    (solve())

Submission status: Accepted

Solution code:
k = int(input())
ans=""
for i in range(k):
    ans=ans+"ACL"  
print(ans)

Submission status: Accepted

Solution code:
import sys
import math

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

K = ini()

s = "ACL"
ans = ""
for i in range(K):
    ans += s
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
s = 'ACL'
r = ''
for i in range(k):
	r += s 
print(r)

Submission status: Accepted

Solution code:
k = int(input())

for i in range(k):
    print('ACL', end='')
print('')

Submission status: Accepted

Solution code:
n = int(input())
s=''
for i in range(n):
    s = s + 'ACL'
print(s)

Submission status: Accepted

Solution code:
s = int(input())

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

Submission status: Accepted

Solution code:
print(int(input()) * 'ACL')

Submission status: Accepted

Solution code:
n = int(input())

s = "ACL"

print(s*n)

Submission status: Accepted

Solution code:
n = int(input())
s = "ACL"
a = ""
for i in range(n):
    a += s
print(a)

Submission status: Accepted

Solution code:
k = int(input())
s = "ACL"
ans=""
for i in range(k):
  ans+=s
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
ans ="ACL"
for i in range(N-1):
    ans=ans+"ACL"
print(ans)

Submission status: Accepted

Solution code:
n=int(input())


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

Submission status: Accepted

Solution code:
for i in range(int(input())):
  print("ACL", end="")

Submission status: Accepted

Solution code:
K= int(input())
for i in range(K):
    print("ACL", end='')

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    print('ACL' * k)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())
for i in range(k):
    print("ACL", end="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
#数値入力
K = int(input())

s = ''

for i in range(K):
    s = s + 'ACL'

print(s)

Submission status: Accepted

Solution code:
N = int(input())
a = ""

for i in range(N):
  a = a + str("ACL")
print(a)

Submission status: Accepted

Solution code:
N = int(input())
# a, b, c, d = map(int, input().split())
# N = 0

ACL = 'ACL'

print(ACL * N)

Submission status: Accepted

Solution code:
K=int(input())
a=""
while K>0:
    a+="ACL"
    K-=1
print(a)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

def inp():
    return int(input())
def inps():
    return input().rstrip()
def inpl():
    return list(map(int, input().split()))
def inpls():
    return list(map(str, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)

# import decimal
# from decimal import Decimal
# decimal.getcontext().prec = 10

# from heapq import heappush, heappop, heapify
# import math
# from math import gcd
# import itertools as it
# import collections
# from collections import deque 

# ---------------------------------------

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

Submission status: Accepted

Solution code:
K=int(input())
Ans=''
for i in range(K):
  Ans+='ACL'
  
print(Ans)

Submission status: Accepted

Solution code:
K = int(input())
result= ''
if K == 0:
    print(result)
else:
    for i in range(K):
        result += 'ACL'
    print(result)

Submission status: Accepted

Solution code:
k = input()
print('ACL' * int(k))

Submission status: Accepted

Solution code:
n=int(input())
ans = ""
for i in range(n):
  ans+="ACL"
  
print(ans)

Submission status: Accepted

Solution code:

n = int(input())

st = "ACL"

print(st * n)

Submission status: Accepted

Solution code:
str='ACL'
n=int(input())
print(str*n)

Submission status: Accepted

Solution code:
k = int(input())
ans = "ACL"
print(ans * k)

Submission status: Accepted

Solution code:
n = int(input())
ans = ""
for i in range(n):
  ans = ans + "ACL"
  
print(ans)

Submission status: Accepted

Solution code:
K=int(input())
for i in range(K):
    print('ACL',end='')

Submission status: Accepted

Solution code:
K=int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

temp = str()
for i in range(K):
	temp+='ACL'
print(temp)

Submission status: Accepted

Solution code:
def II(): return int(input())
k=II()

ans="ACL"*k
print(ans)

Submission status: Accepted

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

n=int(input())
print("ACL"*n)

Submission status: Accepted

Solution code:
k=int(input())

ans=""

for i in range(k):
    ans=ans+"ACL"

print(ans)

Submission status: Accepted

Solution code:
k=int(input())
for i in range (k):
  print('ACL',end='')

Submission status: Accepted

Solution code:
K = int(input())
a = "ACL"

print(a*K)