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

Solution (Python):
import sys,math,collections
from collections import defaultdict


    
def file():
    sys.stdin = open('input.py', 'r')
    sys.stdout = open('output.py', 'w') 
def get_array():
    l=list(map(int, input().split()))
    return l
def get_ints():   
    return map(int, input().split())
    
def get_3_ints():   
    a,b,c=map(int, input().split())
    return a,b,c    
def sod(n):
    n,c=str(n),0
    for i in n: 
        c+=int(i)
    return c    
def isPrime(n):
    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 getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    floor = -1
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == x:
            return A[mid]
        elif x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            left = mid + 1
            
    return floor
def chk(aa,bb):
	f=0
	for i in aa:
		for j in bb:
			if(j[0]>=i[0] and j[1]<=i[1]):
				f+=1
			elif(j[0]<=i[0] and j[1]>=i[1]):	
				f+=1
			elif(i[0]==j[1] or i[1]==j[0]):
				f+=1
			else:
				continue
	return f			


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


	
	



		




				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








if __name__ == '__main__':
    main()

Solution (Python):
k = int(input())

ans = "ACL"*k
print(ans)

Solution (Python):

n = int(input())

ans = ""

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

print(ans)

Solution (Python):
k = int(input())

print(k * 'ACL')

Solution (Python):




import sys

def read_str(): return sys.stdin.readline().strip()
def read_int(): return int(sys.stdin.readline().strip())
def read_ints(): return map(int, sys.stdin.readline().strip().split())
def read_str_split(): return list(sys.stdin.readline().strip())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))

def Main():
    k = read_int()
    print('ACL' * k)

if __name__ == '__main__':
    Main()

Solution (Python):
k = int(input())

word = "ACL"* k
print(word)

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

Solution (Python):
(N, ) = [int(n) for n in input().split()]
print('ACL'*N)

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

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

Solution (Python):
print(int(input())*"ACL")

Solution (Python):
import sys



def input():
    return sys.stdin.readline().rstrip()


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






if __name__ == "__main__":
    main()

Solution (Python):
k = int(input())

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

Solution (Python):
K = int(input())
print(K*'ACL')

Solution (Python):

def main():
    K = int(input())
    print('ACL' * K)


if __name__ == '__main__':
    main()

Solution (Python):
K=int(input())

str=[]
for _ in range(K):
  str=str+["ACL"]
print("".join(str))

Solution (Python):
from sys import stdin, stdout
from collections import defaultdict
input = stdin.readline
k = int(input())
print("ACL"*k)

Solution (Python):
def resolve():
    k = int(input())
    print("ACL"*k)
resolve()

Solution (Python):
k = int(input())

print('ACL'*k)

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

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

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

Solution (Python):
N = int(input())
print(N*'ACL')

Solution (Python):
N = int(input())
print('ACL'*N)

Solution (Python):
a = "ACL"

K = int(input())
s = ""
for _ in range(K):
  s += a
  
print(s)

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

Solution (Python):
def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

k = int(input())
ans = "ACL"*k
print(ans)

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

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

print(ans)

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

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

Solution (Python):
from math import gcd

from math import factorial as f

from math import ceil, floor, sqrt
import math

import bisect
import re
import heapq

from copy import deepcopy
import itertools
from itertools import permutations

from sys import exit

ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

yes = "Yes"
no = "No"


def main():
    a = 'ACL'
    n = ii()
    ans = ''
    for i in range(n):
        ans += a
    print(ans)


main()

Solution (Python):
a=int(input())
print("ACL"*a)

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

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

Solution (Python):
K=int(input())
print('ACL'*K)

Solution (Python):
import math
import sys
import os

sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))

if os.getenv("LOCAL"):
    inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
    sys.stdin = open(inputFile, "r")
INF = float("inf")


a = I()
ans = ''

for _ in range(a):
    ans += 'ACL'

print(ans)

Solution (Python):
print(int(input())*"ACL")

Solution (Python):
print("ACL"*int(input()))

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

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

Solution (Python):
import sys
input = sys.stdin.readline
I=lambda:int(input())
MI=lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))


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

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

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

Solution (Python):
K = int(input())

A = 'ACL'

print(A*K)

Solution (Python):
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10

K = INT()
ans = 'ACL' * K
print(ans)

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

Solution (Python):
K=int(input())
print('ACL'*K)

Solution (Python):
n = int(input())

print("ACL"*n)

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

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

Solution (Python):
print("ACL"*int(input()))

Solution (Python):
print("ACL" * int(input()))

Solution (Python):
k = int(input())

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

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

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

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

Solution (Python):
K = int(input())
print('ACL'*K)

Solution (Python):
import sys
import math

n = int(input())

print("ACL" *n)

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

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

Solution (Python):
K = int(input())
print('ACL' * K)

Solution (Python):
n=int(input())
s=[]
for i in range(n):
  s.append('A')
  s.append('C')
  s.append('L')
print(''.join(s))

Solution (Python):
def main():
    k = int(input())
    print("ACL" * k)


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
print(int(input())*"ACL")

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

Solution (Python):
k = int(input())

print('ACL'*k)

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

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

Solution (Python):



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

Solution (Python):
def main():
    K = int(input())
    print('ACL' * K)


if __name__ == '__main__':
    main()

Solution (Python):
s = int(input())


ans = 0
cnt = 0
print("ACL"*s)

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations,product

from heapq import heapify,heappop,heappush

from functools import reduce,lru_cache

from decimal import Decimal
from argparse import ArgumentParser

args=ArgumentParser()
args.add_argument('-loc', '--local', type=bool,default=False)
LOCAL=args.parse_args().local

def input(): 
    x=sys.stdin.readline(); 
    if x[-1]=="\n": 
        return x.rstrip() 
    return x
    
def printe(*x):_=print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def bitr(x): return format(x, 'b')
def bitlen(x): 
    if x: return int(math.log2(x))+1 
    else: return 1;
def popcount(x): 
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    

    N = int(input())
    
    
    
    

    print("ACL"*N)



if __name__ == "__main__":
    main()

Solution (Python):

from math import floor, ceil, sqrt, factorial, log, gcd, log10
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement, chain
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heappushpop, heapify
from copy import copy, deepcopy
import sys
INF = float('inf')
mod = 10**9+7
sys.setrecursionlimit(10 ** 6)


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


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))




def I(): return int(sys.stdin.buffer.readline())



def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()




def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')



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






k = I()
print("ACL"*k)

Solution (Python):
k = int(input())

print("ACL" * k)

Solution (Python):







N = int(input())




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

print(ans)

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

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

Solution (Python):
K = int(input())
print('ACL'*K)

Solution (Python):
K = int(input())
print('ACL'*K)

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  
def LS2(): return list(sys.stdin.readline().rstrip())  


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

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

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

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

Solution (Python):
def main():
    k = int(input())
    print("ACL"*k)


if __name__ == "__main__":
    main()

Solution (Python):
print("ACL"*int(input()))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

    k=I()
    s=""
    for i in range(k):
        s+="ACL"
    print(s)
    








if __name__=="__main__":
    main()

Solution (Python):
n = int(input())
s = "ACL"
print(s*n)

Solution (Python):
k=int(input())

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

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

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

Solution (Python):
A = int(input())

print ("ACL" * A)

Solution (Python):
K = int(input())
print(K*'ACL')

Solution (Python):
N = int(input())

print(N * 'ACL')

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

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

Solution (Python):
k = int(input())

print('ACL'*k)

Solution (Python):
print("ACL" * int(input()))

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

Solution (Python):
print("ACL"*int(input()))

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

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

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    n = i_input()
    
    print('ACL'*n)

if __name__ == '__main__':
    main()

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

Solution (Python):
k=int(input())

print(k*'ACL')

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")



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


if __name__ == '__main__':
    main()

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import deque, defaultdict, Counter
import heapq
def main():
    K = I()
    print('ACL' * K)

if __name__ == "__main__":
    main()

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

Solution (Python):
def solve():
    k = int(input())
    print('ACL'*k)


def main():
    t = 1
    while t > 0:
        solve()
        t -= 1


main()

Solution (Python):
K = int(input())
print('ACL' * K)

Solution (Python):


from collections import defaultdict
mod = 10 ** 9 + 7; INF = float("inf")

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

def inverse(N, mod):
	return (pow(N, mod - 2, mod))

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




if __name__ == '__main__':
	main()

Solution (Python):
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


def main():
    k = i_input()
    print("ACL"*k)


    

 

if __name__=="__main__":
    main()

Solution (Python):
K = int(input())

print("ACL"*K)

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

Solution (Python):
num = int(input())
print('ACL' * num)

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

if __name__ == "__main__":
    main()

Solution (Python):
k = int(input())



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

Solution (Python):
def rl():
    return [int(x) for x in input().split()]
k = int(input())
print('ACL'*(k))

Solution (Python):
print("ACL"*int(input()))

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

Solution (Python):
def main():
    K = int(input())

    return "ACL" * K

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

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

Solution (Python):
print("ACL"*int(input()))

Solution (Python):
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]

k=II()
print("ACL"*k)

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

Solution (Python):
n = int(input())



print("ACL"*n)

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

Solution (Python):
K = int(input())

print(K * "ACL")

Solution (Python):
K = int(input())

print("ACL"*K)

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

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

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()

k = int(input())
out = "ACL" * k
print(out)

Solution (Python):
print(int(input())*"ACL")

Solution (Python):
x=int(input())
print('ACL'*x)

Solution (Python):


import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy

import heapq
import random
import time
import os
import sys
from functools import lru_cache,reduce
readline=sys.stdin.readline
sys.setrecursionlimit(100000)
alp="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Set():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(bool)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        if not self.find(x):
            heapq.heappush(self.heap,x)
            self.dic[x]=True
            self.size+=1

    def remove(self,x):
        if self.find(x):
            self.dic[x]=False
            self.size-=1

    def find(self,x):
        return self.dic[x]
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==False:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class multiset():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(int)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        heapq.heappush(self.heap,x)
        self.dic[x]+=1
        self.size+=1

    def remove(self,x):
        if self.dic[x]>0:
            self.dic[x]-=1
            self.size-=1
    
    def count(self,x):
        return self.dic[x]

    def find(self,x):
        return self.dic[x]>0
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==0:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class Point():
    def __init__(self,y,x):
        self.x=x
        self.y=y
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):print("yes" if b else "no")
def Yn(b):print("Yes" if b else "No")
def YN(b):print("YES" if b else "NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(b,t,f):return t if b else f
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def inputintlist(row=1): 
    if row==1:
        ret=list(map(int,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=int(input())
    return ret
def inputfloatlist(row=1): 
    if row==1:
        ret=list(map(float,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=float(input())
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    from queue import PriorityQueue
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def zipsort(*args):
    ziplist=sorted(zip(*args))
    for a in range(len(args)):
        for b in range(len(ziplist)):
            args[a][b]=ziplist[b][a]
def zipreverse(*args):
    ziplist=list(zip(*args))
    rev=[]
    for a in range(len(ziplist)-1,-1,-1):
        rev.append(ziplist[a])
    for a in range(len(args)):
        for b in range(len(rev)):
            args[a][b]=rev[b][a]

def to10(A):
    ret=0
    for a in range(len(A)-1,-1,-1):
        ret+=X[a]*2**(N-1-a)
    return ret

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    K = int(input())
    print("ACL"*K)

if __name__ == "__main__":
    resolve()

Solution (Python):
K = int(input())

print("ACL"*K)

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

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

Solution (Python):
from collections import Counter
import math
import statistics
import itertools

b=int(input())












print("ACL"*b)

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

Solution (Python):
s = "ACL"

K = int(input())

print(s * K)

Solution (Python):
def main():
    K = int(input())
    print("ACL"*K)


if __name__ == '__main__':
    main()

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

Solution (Python):
K = int(input())
print('ACL' * K)

Solution (Python):
n = int(input())
a = 'ACL'

print(a*n)

Solution (Python):
import sys
input = sys.stdin.readline
K = int(input())

print('ACL'*K)

Solution (Python):
print("ACL"*int(input()))

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

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

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

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

Solution (Python):



import sys

K = int(input())

print("ACL" * K)

Solution (Python):
if __name__ == "__main__":
    K = int(input())
    print("ACL"*K)

Solution (Python):
import sys
input = sys.stdin.buffer.readline

MOD = 10 ** 9 + 7
INF = 2 * 10**18

in_n = lambda: int(input())
in_nn = lambda: map(int, input().split())
in_s = lambda: input().rstrip().decode('utf-8')
in_map = lambda: [s == ord('.') for s in input() if s != ord('\n')]


def main():
    k = in_n()
    print("ACL" * k)


if __name__ == '__main__':
    main()

Solution (Python):
print("ACL"*int(input()))

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

Solution (Python):
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == '__main__':
    main()