include<bits/stdc++.h>

using namespace std;

bool uoc_nguyen_to (int n)
{
if (n < 2)
{
return false;
}

for (int i = 2; i <= sqrt(n); i++)
{
    if (n % i == 0)
    {
        return false;
    }
}

return true;

}
int main ()
{
int n;
cin >> n;
int sum = 0;

for (int i = 2; i <= sqrt (n); i++)
{
    if (uoc_nguyen_to(n)) 
        cout << i << " ";
        sum += i;
}

return 0;

}

yes sir

There is nothing other than these 8-word sentences.

def chain(n, a):
if n==1: return 0
i=0
t=0
while (n>1):
for _ in range(a[i]):
t += 1
n -= 1
if n==1: return t
i += 1
n-=1

return t