saidojasoidjasiodjasoidjassaiojdaosi

def snt(n):
kt=True
for i in range(2,int(n(0.5))+1):
if n%i==0:
kt=False
return kt
a=[]
n=105
for i in range(2,n+1):
if snt(i)==True:
a.append(i)
t=int(input())
for i in range(t):
n=int(input())
print(a[n])

uoc

Condemned to darkness, where our power grows.

tt

include <bits/stdc++.h>

using namespace std;
int n,f[1000001],a[1000001],ans=1;
int main()
{
cin>>n;
for (int i=1;i<=n;i++){
cin>>a[i];
f[i]=1;
for (int j=1;j<=i-1;j++)
if (a[j]<a[i]) f[i]=max(f[i],f[j]+1);
ans=max(ans,f[i]);
}
cout<<ans;
}