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: Runtime Error

Solution code:
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#define read(a) scanf("%d", &a)
#define readf(a) scanf("%lf", &a)
#define pb push_back
#define mk make_pair
#define _rand mt19937 RAND(time(0))
#define mem(a) memset(a, 0, sizeof(a))
#define Buff ios::sync_with_stdio(false)
typedef long long ll;
using namespace std;
const int INF = 1e9 + 7;
const int N = 3e5 + 7;
const int M = 1e6 + 7;

#define lson rt << 1
#define rson rt << 1 | 1
template<class T>
class SegTree
{
public:
    T maxv[N << 2];
    void init()
    {
        mem(maxv);
    }
    inline void pushup(int rt)
    {
        maxv[rt] = max(maxv[lson], maxv[rson]);
    }
    void update(int rt, int l, int r,int pos, T val)
    {
        if(l == r)
        {
            maxv[rt] = max(maxv[rt], val);
            return;
        }
        int mid = (l + r) >> 1;
        if(pos <= mid) update(lson, l, mid, pos, val);
        else          update(rson, mid + 1, r, pos, val);
        pushup(rt);
    }

    T query(int rt, int l, int r, int L, int R)
    {
        if(L <= l && r <= R) return maxv[rt];
        int mid = (l + r) >> 1;
        T ans = 0;
        if(L <= mid) ans = max(ans, query(lson, l, mid, L, R));
        if(R > mid)  ans = max(ans, query(rson, mid + 1, r, L, R));
        return ans;
    }
};
SegTree<int> tree;

int a[N];
signed main()
{
    int k;
    cin >> k;
    while(k--) cout << "ACL";
    return 0;
}
/**
**/

Submission status: Runtime Error

Solution code:
import numpy as np
number=input().rstrip().split(' ')
N=int(number[0])
M=int(number[1])
judge=np.zeros([N-1])

for i in range(M):
    cities=input().rstrip().split(' ')
    A=int(cities[0])
    judge[A-1]=1

print(np.count_nonzero(judge==0))

Submission status: Runtime Error

Solution code:
a,b,c,d=list(map(int ,input().split()))
max_v=max(a,c)
min_v=min(b,d)
if(max_v-min_v>0 or min_v-max_v<0):
  print("No")
elif(max_v-min_v>0):
  print("Yes")

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
A = []
# N, K = 10, 3
# A = [1,5,4,3,8,6,9,7,2,4]
for _ in range(N):
  A.append(int(input()))
dp = [0]*N
nextdp = [1]*(300000)
tmp = 0
while tmp < N:
  dp[tmp] = nextdp[A[tmp]]
  for n in range(0,2*K+1):
    n -= K
    if 300000 > A[tmp]+n >= 0:
      nextdp[A[tmp]+n] = max(nextdp[A[tmp]+n], dp[tmp]+1)
  tmp += 1
print(dp[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,M = map(int,input().split())
A,B = map(int,input().split())

count = 1

for i in range(N):
   
      
    if  count == A or B:
        count += 0
    else:
       count += 1 
    
print(count)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
A = [int(input()) for i in range(N)]


ans = []

i = 0
while(i<=N-2):
  a = A[i]
  T = 1
  while (i<=N-3):
    if ( abs(a-A[i+1]) <= K ):
      T += 1
      a = A[i]
    i += 1
  ans.append(T)
  i += 1
  
print(max(ans))

Submission status: Runtime Error

Solution code:
return "ACL"*K

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
A = [int(input()) for i in range(N)]


ans = []

i = 0
while(i<=N-2):
  a = A[i]
  T = 1
  while (i<=N-2):
    if ( abs(a-A[i]) <= K ):
      T += 1
      a = A[i]
    i += 1
  ans.append(T)
  i += 1
  
print(max(ans))

Submission status: Runtime Error

Solution code:
import numpy as np
number=input().rstrip().split(' ')
N=int(number[0])
M=int(number[1])
judge=np.zeros([N-1],dtype=np.int16)

for i in range(M):
    cities=input().rstrip().split(' ')
    A=int(cities[0])
    judge[A-1]=1

print(np.count_nonzero(judge==0))

Submission status: Runtime Error

Solution code:
text = "ACL"
output = text * K
print(output)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import defaultdict
N,M=map(int,input().split())
AB=list()
memo=[False]*N
G=defaultdict(list)
def dfs(G,i):
    memo[i]=True
    for j in G[i]:
        if memo[j]==False:
            dfs(G,j)
count=0
for i in range(M):
    AB=list(map(int,input().split()))
    G[AB[1]-1].append(AB[0]-1)
    G[AB[0]-1].append(AB[1]-1)
for i in range(N):
    if memo[i]==False:
        dfs(G,i)
        count+=1
print(count-1)

Submission status: Runtime Error

Solution code:
N, K = input().split()
K = int(K)
count = 1  # 最初は必ず含む
l = []
l_true = []
S = 0
S1 = 1
for i in range(int(N)):
    l.append(int(input()))
for S1 in range(int(N)):
   for i in range(int(N)):
       if abs(l[S] - l[S1]) <= K:
            l_true.append(A2)
            count += 1
            S += 1
            S1 += 1
        else:
            pass


print(count)

Submission status: Runtime Error

Solution code:
text = "ACL"*K
print(text)

Submission status: Runtime Error

Solution code:
n = (int)input()
while(n--):
  print("ACL")

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
towns = [0] * n
cnt = 1

def rewr(x, y, z):
    if x == y:
        return z
    else:
        return x

for i in range(m):
    a, b = map(int, input().split())
    a -= 1
    b -= 1
    if towns[a] == 0 and towns[b] == 0:
        towns[a] = cnt
        towns[b] = cnt
        cnt += 1
    elif towns[a] > 0 and towns[b] == 0:
        towns[b] = towns[a]
    elif towns[b] > 0 and towns[a] == 0:
        towns[a] = towns[b]
    elif towns[a] > 0 and towns[b] > 0:
        if towns[a] != towns[b]:
            min_no = min(towns[a], towns[b])
            max_no = max(towns[a], towns[b])
            towns = [rewr(twn, max_no, min_no) for twn in towns]
    else:
        pass
        #print('pass')

rslt = 0
#print(towns)
rslt += max(towns) - 1
rslt += towns.count(0)
print(rslt)

Submission status: Runtime Error

Solution code:
A,B,C,D = map(int, input().split())
 
x = list(range(A,B+1))
x = set(x)
y = list(range(C,D+1))
y = set(y)
 
if len(x)==0 or len(y)==0 or len(x&y)==0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
N,M= [int(x) for x in input().split()]

root = list(range(N))

for i in range(M):
    A,B = [int(x)-1 for x in input().split()]
    a = root[A]
    b = root[B]
    if a<b:
        root = [a if i == b else i for i in root]
    if b<a:
        root = [b if i == a else i for i in root]

print(len(set(root))-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K = 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: Runtime Error

Solution code:
num = input()
a = ""
for _ in range(num):
  a += "ACL"
return a

Submission status: Runtime Error

Solution code:
K = 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: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())
d = int(input())
A = [i for i in range(a, b + 1)]
B = [i for i in range(c, d + 1)]
for i in A:
    if i in B:
        a = True
        break
if a == True:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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: Runtime Error

Solution code:
A,B,C,D = map(int, input().split())
if B < C or D < A:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
import bisect
n, k = map(int, input().split())
a = [int(input()) for _ in range(n)]
dp = [1 for _ in range(n)]
for i in range(n):
    for j in range(i-1, -1, -1):
        if abs(a[i] - a[j]) <= k:
            dp[i] = max(dp[i], dp[j]+1)
print(dp[-1])

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
from itertools import product
a,b,c,d = map(int, input().split())
ans = 0
sunuke = range(a, b + 1)
takahashi = range(c, d + 1)
for sunuke, i in product(sunuke, takahashi):
    if sunuke == i:
        ans += 1
if ans > 0:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n = int(input())

if n == 1:
  print("ACL"):
elif n == 2:
  print("ACLACL"):
elif n == 3:
  print("ACLACLACL"):
elif n == 4:
  print("ACLACLACLACL"):
else:
  print("ACLACLACLACLACL"):

Submission status: Runtime Error

Solution code:
x=input()
print('ACL'*x)

Submission status: Runtime Error

Solution code:
n = int(input())

print(”ACL”*n)

Submission status: Runtime Error

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

if a <c:
  

    if b-c>=0 :
       print ("Yes")
    else:
       print("No")
        
else:
    if b-c>=0 :
       print ("No")
    else:
       print("Yes")

Submission status: Runtime Error

Solution code:
class UnionFind:
    pairs = {}
    def __init__(self, n):
        for i in range(n):
            self.pairs[i] = i

    def set(self, s, t):
        self.pairs[s] = t

    def root(self, x):
        if self.pairs[x] == x:
            return x
        self.pairs[x] = self.root(self.pairs[x])
        return self.pairs[x]

def main():
    n, m = map(int, input().split())

    uf = UnionFind(n)
    for i in range(m):
        s, t = map(int,input().split())
        if s-1 <= t-1:
            uf.set(s - 1, t - 1)
        else:
            uf.set(t-1, s-1)

    root = []
    for i in range(n):
        root.append(uf.root(i))

    single_root = set(root)

    print(len(single_root)-1)
main()

Submission status: Runtime Error

Solution code:
s = input()

if s == 1:
  print("ACL"):
elif s == 2:
  print("ACLACL"):
elif s == 3:
  print("ACLACLACL"):
elif s == 4:
  print("ACLACLACLACL"):
else:
  print("ACLACLACLACLACL"):

Submission status: Runtime Error

Solution code:
print(K*"AKL")

Submission status: Runtime Error

Solution code:
str = input()
a, b, c, d = str.split(' ')
B = int(b)
C = int(c)

if B >= C:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

N,M = map(int,input().split())
AB= [list(map(int,input().split())) for _ in range(M)]

uf = UnionFind(N)
for ab in AB:
    uf.union(ab[0]-1,ab[1]-1)
print(uf.group_count()-1)

Submission status: Runtime Error

Solution code:
if C<=A<=D or C<=B<=D or A<=C<=B or A<=D<=B: print("Yes")
else: print("No")

Submission status: Runtime Error

Solution code:
spam='ACL'
print(spam*K)

Submission status: Runtime Error

Solution code:
s = int(input())

if s == 1:
  print("ACL"):
elif s == 2:
  print("ACLACL"):
elif s == 3:
  print("ACLACLACL"):
elif s == 4:
  print("ACLACLACLACL"):
else:
  peint("ACLACLACLACLACL"):

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c, d = map(int,input().split())
print('Yes' if a <= b <= c <= d else 'No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    k = int(input)

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

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

typedef long long int ll;
typedef long long unsigned int ull;
typedef long double ld;
typedef vector<int> vr;
typedef pair<int, int> pr;
#define pb push_back
#define ff first
#define ss second
#define INF 1999999999
#define MODA 1000000007
#define PI 3.1415926535897932384626433
#define endl "\n"
//cout << fixed << setprecision(2);


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    string ans = "";
    while(n--){
        ans += "ACL";
    }
    cout << ans << endl;

    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C,D = map(int,input().split())
if B>=C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
#include <stdio.h>

int main(int argc, const char * argv[]) {
    // insert code here...
    int x, i=0;
    scanf("%d", &x);
    while(i<=x){
        printf("ACL");
    }
   
    return 0;
}

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
k = int(input())

str = ""
for i in k:
  str += "ALC"
 
print(str)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
k = int(input())

for i in k:
  str += "ALC"
 
print(str)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# cook your dish here
n=int(input())
s=""
for i in range(k):
    s+="ACL"
print(s)

Submission status: Runtime Error

Solution code:
k=int(raw_input(''))
s=""

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

print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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



int main() {
  int K;
  cin >> K;
  string a ="ACL";
  
  for(int i = 0; i < K; i++){
   cout << a;
  }
  
  cout << endl;

}

Submission status: Runtime Error

Solution code:
from sys import stdin

a = stdin.readline().rstrip()

print('ACL'*a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
stdin=sys.stdin

ip=lambda: int(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()


k=sp()

r='ACL'

print(r*k)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#include <array>
#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
 
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << v[i];
    }
    return os;
}
 
struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
 
#define MAX_N 1010101
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
 
using mi = modint;
 
mi mod_pow(mi a, ll n) {
    mi ret = 1;
    mi tmp = a;
    while(n > 0) {
        if(n % 2) ret *= tmp;
        tmp = tmp * tmp;
        n /= 2;
    }
    return ret;
}
 
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int k;
    cin >> k;
    string ans = "";
    REP(i, k) ans += "ACL";
    cout << ans << endl;
    return 0;
}