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):
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")

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):
a = int(input())
print('ACL'*a)

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

Solution (Python):
k=int(input())
k+=1
o=''
a='ACL'
if k==1:
  print('')
  exit()
else:
  for i in range(1,k):
  	o=o+a
print(o)

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

s = 'ACL' * k

print(s)

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

s = ""

for _ in range(k):
    s += "ACL"

print(s)

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

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

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

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

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

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

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

Solution (Python):
K=input()
r='ACL'
for i in range(1,int(K)):
  r='ACL'+ r 
print(r)

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

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

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

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

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

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

print("ACL"*n)

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

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

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

Solution (Python):
def solve():
	k=int(input())
	r=''
	for i in range(k):
		r+='ACL'
	return r

print(solve())

Solution (Python):
print(''.join(map(str, ["ACL" for _ in range(int(input()))])))

Solution (Python):
k=int(input())
l=['ACL']*k
print(*l,sep='')

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

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

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

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

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)

def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')







def solve():
    k = II()
    print('ACL' * k)

if __name__ == '__main__':
    solve()

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

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

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

if __name__ == "__main__":
    main()

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

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

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

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

print('ACL'*k)

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

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

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

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 _ in range(K):
    ans += "ACL"

print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

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

Solution (Python):
k= int(input())
lista=[]
palavra='ACL'
for x in range(k):
    lista.append(palavra)
print(''.join(lista))

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

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

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K = INT()
print("ACL"*K)

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

K = int(readline())

A = "ACL"
ans = ""
while K:
  if K & 1:
    ans += A
  A *= 2
  K >>= 1

print(ans)

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

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

res = ''
while(k >= 1):
    res += 'ACL'
    k -= 1
print(res)

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

ans = ""

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

print(ans)

Solution (Python):
N, = map(int, input().split())
print("ACL"*N)

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

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

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

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

Solution (Python):


MOD = 10 ** 9 + 7

K = int(input())

print('ACL' * K)

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):
a = input()
K = int(a)

x = 'ACL'

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

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



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

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

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

print()

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

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

Solution (Python):
from sys import stdin
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return map(int, readline().rstrip().split())
def i_list(): return list(i_map())

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

if __name__ == "__main__":
    main()

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

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

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

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

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):
print('ACL'*int(input()))

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

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

Solution (Python):
k = int(input())
ans=[]
for i in range(k):
  ans.append("ACL")

print("".join(ans))

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):
k = int(input())
print('ACL'*k)

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

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

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

Solution (Python):


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

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

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

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

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

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

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

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

Solution (Python):

import collections as cl
import sys


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 main():
    k = II()
    ans = ""
    for i in range(k):
        ans += "ACL"

    print(ans)


main()

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

Solution (Python):
import math,itertools,fractions,heapq,collections,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 F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  k=I()
  return 'ACL'*k


print(main())

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

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

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

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

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

Solution (Python):
K=int(input())
A=[]
for i in range(K):
    A.append('ACL')

print(''.join(A))

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

Solution (Python):

import sys


def solve(K: str):
    T=[]
    for i in range(int(K)):
        T.append('ACL')
    T = "".join(T)
    return print(T)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = next(tokens)  
    solve(K)

if __name__ == '__main__':
    main()

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

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):
K=int(input())
S="ACL"
K-=1
while K>0:
  S = S+"ACL"
  K-=1
print(S)

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

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

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

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

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

Solution (Python):
K = int(input())
words =''
for w in range(K):
    words += 'ACL'
else:
    print(words)

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

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

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

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

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

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

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

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

Solution (Python):
def solve():
    K = int(input())
    print('ACL' * K)
    
if __name__ == '__main__':
    solve()

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

Solution (Python):
a = input()
str = ""
for i in range(0,int(a)):
  str = str + "ACL"
print(str)

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

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

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

Solution (Python):
import sys
import math

import random

input = sys.stdin.readline
 

def inp():
    return(int(input()))
def inara():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))



n=inp()
print("ACL"*n)

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

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

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

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

print("ACL" * N)

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

Solution (Python):
k = int(input())
a = "ACL"

print(a*k)

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    K=I()
    print("ACL"*K)

main()

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

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

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

print('ACL'*K)

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

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

print("".join(["ACL" for i in range(n)]))

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

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

output=''
for _ in range(n):
  output+='ACL'
  
print(output)

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

print("ACL" * K)

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

print (k*str("ACL"))

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
k = I()
print('ACL'*k)

Solution (Python):


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

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

for i in range(1,K+1):
    c += 'ACL'

print(c)

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

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

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

print('ACL' * k)

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

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

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

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

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

Solution (Python):
import sys


K = int(input())

for i in range(K):
    sys.stdout.write("ACL")

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

Solution (Python):
K = int(input())
L = []
for i in range(K):
  L += ['A', 'C', 'L']
print(''.join(L))

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

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

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

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

Solution (Python):



"""






















using namespace std;

using int64 = long long;




int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int k; cin >> k;
  for (int i = 0; i < k; ++i) {
    cout << "ACL";
  }

  cout << endl;

  return 0;
}

"""

import base64
import subprocess
import zlib


exe_bin = "c$~

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

Solution (Python):


k = int(input())
s = 'ACL'
ans = ''
for i in range(k):
    ans += s

print(ans)

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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):
print("ACL"*int(input()))

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

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

print(ans)

Solution (Python):

import sys


sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
printout = sys.stdout.write
sprint = sys.stdout.flush


sys.setrecursionlimit(10 ** 7)





from collections import deque



INF = 1 << 50
EPS = 1e-8
mod = 998244353


def intread():
    return int(sysread())
def mapline(t=int):
    return map(t, sysread().split())
def mapread(t=int):
    return map(t, read().split())

def run():
     K = intread()
     print('ACL' * K)

if __name__ == "__main__":
    run()

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

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

Solution (Python):
print(eval("'ACL'*"+input()))

Solution (Python):

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

Solution (Python):
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    temp = I()
    print("ACL"*temp)
    
if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import sys


def resolve(in_):
    K = int(next(in_))
    return 'ACL' * K
    

def main():
    ans = resolve(sys.stdin.buffer)
    print(ans)


if __name__ == '__main__':
    main()

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

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

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

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

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

ans = n*"ACL"
print(ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop, heapify
from functools import reduce, lru_cache
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


K = INT()
print("ACL"*K)

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

print('ACL'*k)

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

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

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

Solution (Python):
n = int(input())
arr = ['ACL']*n
arr2 = ''.join(arr)
print(arr2)

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

Solution (Python):



from math import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq














import sys
sys.setrecursionlimit(10000000)


mod = 998244353
INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
k = I()
print('ACL' * k)

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

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

if __name__ == "__main__":
    main()

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

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):
K=int(input())
res=""
for i in range(K) :
  res+="ACL"
print(res)

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

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

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

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    k  = int(input())
    ans = ""
    for i in range(k):
        ans += "ACL"
    print(ans)

if __name__=='__main__':
    main()

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

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

print("ACL"*k)

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

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

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

Solution (Python):

import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
print('ACL'*N)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


if __name__ == '__main__':
    main()

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())
print("ACL"*n)

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

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):
from sys import stdin
input = stdin.readline

K = int(input())

print("ACL" * K)

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

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

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

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

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

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

if __name__ == "__main__":
    this_class = ARepeatACL()
    this_class.main()

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

Solution (Python):
k = int(input())
S = "ACL"

for i in range(3*k):
    print(S[i%3],end='')

print("")

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

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

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):
s="ACL"*int(input()) 
print(s)

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)

import math

import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache





MOD = 10**9+7
INF = float('inf')
AZ = "abcdefghijklmnopqrstuvwxyz"






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]



def DD(arg): return defaultdict(arg)


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n): return kaijo_memo[n]
  if(len(kaijo_memo) == 0): kaijo_memo.append(1)
  while(len(kaijo_memo) <= n): kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n): return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0): gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n): gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if n == r: return 1
  if n < r or r < 0: return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1: arr.append([temp, 1])
  if arr==[]: arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b: a, b = b, a % b
    return a


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


def count_bit(n):
  count = 0
  while n:
    n &= n-1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n: return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))

def base_10_to_n_without_0(X, n):
  X -= 1
  if X//n: return base_10_to_n_without_0(X//n, n)+[X%n]
  return [X%n]


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





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

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

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

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

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

Solution (Python):
def main():
    k = int(input())
    acl = 'ACL'
    ans = ''
    for i in range(k):
        ans += acl
    print(ans)
if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

import os
import sys
from io import BytesIO, IOBase

def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def li():  return list(mi())

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






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



if __name__ == "__main__":
    main()

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

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

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

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

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