# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<1) return false;
	else
	for(long long i=2;i<=h/2;i++)
	  if (h%i==0) return false;
	  return true;
}
int main ()
{
	long long n;
	cin>>n;
	if (ngto(n)) cout<<" Dung ";
	else cout<<" Khong ";
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	else
	for(long long i=2;i<=h/2;i++)
	  if (h%i==0) return false;
	  return true;
}
int main ()
{
	long long n,d=0;
	cin>>n;
	for (long long j=2; j<=n;j++)
	  if (ngto(j))
	  {
	    cout<<j<<"  ";
	    d++;
	  }
	  cout<<endl<<" Vay co tat ca " << d << " so ";
}


# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(int n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	int n;
	cin>>n;
	if(snt(n)==true) cout<<"Yes";
	else cout<<"No";	
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	else
	for(long long i=2;i<=h/2;i++)
	  if (h%i==0) return false;
	  return true;
}
int main ()
{
	long long n,d=0;
	cin>>n;
	n++;
    while (ngto(n)==false)
      n++;
    cout<<n;  
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(int n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	if(snt(i)==true) cout<<i<<" ";
}


# data[].attributes.body
Hai Yen 1

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{	int d=0;
	for(int i=2;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,i;
	cin>>n;
	if(nt(i)==true) cout<<i;
}


# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(int n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	int n,maxx=0;
	cin>>n;
	while(true)
	{
		n++;
		if(snt(n)) break;
	}
	cout<<n;
}


# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	else
	for(long long i=2;i<=h/2;i++)
	  if (h%i==0) return false;
	  return true;
}
long long tong(long long k)
{
	long t=0;
	while (k>0)
	   {
	   	t+=k%10;
	   	k=k/10;
	   }
	return t;   
}
int main ()
{
	long long n,d=0;
	cin>>n;
    for(long long j=2;j<=n;j++)
       if (ngto(tong(j)))
          cout<<j<<"  ";
}


# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	 else
	  for(long long i=2; i<=sqrt(h);i++)
	   if (h%i==0)
	    return false;
	    return true;
}
int main()
{
	int n;
	cin>>n;
	if (ngto(n))
	 cout<<"la so nguyen to";
	 else
	  cout<<"khong la so nguyen to";
}

# data[].attributes.body
HYen 2

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{	int d=0;
	for(int i=2;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,i,a[100];
	cin>>n;
	for(i=1;i<=n;i++)
	cin>>a[i];
	for(i=1;i<=n;i++)
	if(nt(a[i])==true) cout<<a[i];

}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	else
	for(long long i=2;i<=h/2;i++)
	  if (h%i==0) return false;
	  return true;
}
long long tong(long long k)
{
	long t=0;
	while (k>0)
	   {
	   	t+=k%10;
	   	k=k/10;
	   }
	return t;   
}
bool kt(long long h)
{
	while (h>0)
	{
		long tam=h%10;
		if (ngto(tam)==false) return false;
		h=h/10;
	}
	return true;
}
int main ()
{
	long long n,d=0;
	cin>>n;
    for(long long j=2;j<=n;j++)
       if ((kt(j)) and (ngto(j)) and (ngto(tong(j))))
         cout<<j<<"  ";
         
}

# data[].attributes.body
Hyen 3

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{	int d=0;
	for(int i=1;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
int main()
{
	int x,n,i;
	cin>>n;
	int d=n+1;
	while(!nt(d)) x++;
	cout<<x;
	return 0;
	
	
}

# data[].attributes.body
Hyen 4

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{	int d=0;
	for(int i=1;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
long long t(long long k)
{
	long t=0;
		while(k>0)
	{
		
		t=k%10;
		k=k/10;
	}
	return t;
}
int main()
{
	int n,i;
	cin>>n;
	for(int j=1;j<=n;j++)
		if(nt(t(i)))
		cout<<j<<' ';
}
	


# data[].attributes.body
Bai 5

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
	 else
	  for(long long i=2; i<=h/2;i++)
	   if (h%i==0) return false;
	    return true;
}
long long tong(long long k)
{
	long long t=0;
	while (k>0){
		t+=k%10;
		k=k/10;
	}
	return t;
}


int main()
{
	long long n; 
	cin>>n;
	for (long long j=1; j<=n; j++)
	if (ngto(tong(j)))
	 {cout<<j<<" ";}
	 
}

# data[].attributes.body
kyen

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
 bool SNT(long long m)
 {
  if(m<=1) return false;
   else
   {
    for(long i=2;i<=sqrt(m);i++)
	 if(m%i==0)
	 return false;
   }
	 return true;
 }  
	   int main()
	   {
		 int n;
		 cin>>n;
		 for(long i=2;i<=n;i++)
		  if(SNT(i))
		  cout<<i;  	
	  }
 	
 

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool kt(long long n)
{
	int d=0;
	for (int i=1;i<=n;i++)
	if (n%i==0) d=d+1;
	if (d==2) return true;
	else return false;
}
int main()
{
	int n;
	cin>>n;
	if (kt(n)==true) cout<<"so ngto";
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool check(long long a){
	for (int i=2;i<=sqrt(a);i++){
		if (a%i==0) return false;
	}
	return a>1;
}
int main(){
	long long n;
	cin>>n;
for (int i=1;i<=n;i++){
	if (check(i)) cout<<i<<" ";
} 
}

# data[].attributes.body
minha 1

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool snt(int n) {
	int d=0;
	for (int i=1;i<=n;i++) 
	   if (n%i==0) d+=1;
	   if (d==2) return true;
	   else return false;
}
int main() {
	int n;
	cin >> n;
	if (snt(n)) cout << "N la snt";
	else cout << "N khong la snt";
}

# data[].attributes.body
hhdang1

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool kt(long long n)
{
	int d=0;
	for (int i=1;i<=n;i++)
	if (n%i==0) d=d+1;
	if (d==2) return true;
	else return false;
}
int main()
{
	int n,d=0,i;
	cin>>n;
	for(i=1;i<=n;i++)
		if (kt(i)==true) 
		{
			cout<<i<<" ";
			d++;
		}
	cout<<endl;
	cout<<d;
}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool check(long long a){
	for (int i=2;i<=sqrt(a);i++){
		if (a%i==0) return false;
	}
	return a>1;
}
int main(){
	long long n,c;
	c=0;
	cin>>n;
	n++;
	 while (c==0){
	 	if (check(n)){
		 cout<<n;
	 	 c++;
	 	 break;
	 }
	 else (n++);
}
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool ngto(long long h)
{
	if (h<=1) return false;
		else
			for (long long i=2;i<=sqrt(h);i++)
				if (h%i==0)
					return false;
					return true;
}
int main ()
{
	int n,tong;
	cout<<"nhap n: ";
	cin>>n;
	cout<<" bai 1 ";
	if (ngto(n))
		cout<<" yes ";
			else
			cout<<" no ";
	cout<<" bai 2 ";
	for (long long i=2;i<=n;i++)
		if (ngto(i))
			cout<< i<<" " ;
	cout<<" bai 3 ";
	int k=n+1;
	while (ngto(k)==false )
	{
		k++;
	}
	cout<<k;
	cout<<" bai 4 ";
	for (long long i=2;i<=n;i++)
		if (ngto(i))
			tong=tong+i;
				cout<<tong ;
	cout<<" bai 5 ";
	for (long long i=2;i<=n;i++)
		if (ngto(i))
		{
			cout<<i<<" ";
		}
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n){
	int i,d=0;
	for(i=1;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
int main(){
	int n;
	cin>>n;
	if(nt(n)==true) cout<<"La so nt";
	else cout<<"zero";
}

# data[].attributes.body
hhdang2

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n)
{
	int i,d=0;
	for(i=1;i<=n;i++)
	if(n%i==0) d=d+1;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,i,d=0;
	cin>>n;
	for(i=1;i<=n;i++)
	if(nt(i)==true) 
{
	d=d+1;
	cout<<i;
	cout<<endl;
}
	cout<<d;
}

# data[].attributes.attachment_link.readable_text

#include <bits/stdc++.h>
using namespace std;
bool check(long long a){
	for (int i=2;i<=sqrt(a);i++){
		if (a%i==0) return false;
	}
	return a>1;
}
int main(){
	long long a,b,t=0,h=0;
	cin>>a>>b;
	for (int i=a;i<=b;i++){
		t=0;
		h=i;
		while (h>0){
			t=t+h%10;
			h/=10;
		}
		if (check(t)) cout<<t<<" ";
}
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool kt(long long n)
{
	int d=0;
	for (int i=1;i<=n;i++)
	if (n%i==0) d=d+1;
	if (d==2) return true;
	else return false;
}
long long nt(int n)
{
	int t=0;
	while (n!=0)
	{
		t=t+n%10;
		n=n/10;
	}
	return t;
}
int main()
{
	int n,i,s=0,a[100];
	cin>>n;
	for (i=1;i<=n;i++)
	{
		if (kt(nt(i))==true) cout<<i<<" ";
	}
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n){
	int i,d=0;
	for(i=1;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
int main(){
	int n,m;
	cin>>n;
	m=n+1;
	while(nt(m)==false) m=m+1;
	cout<<m;
}


# data[].attributes.body
Khanh Ly

# data[].attributes.body
hhdang3

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n){
	int i,d=0;
	for(i=1;i<=n;i++)
	if(n%i==0) d++;
	if(d==2) return true;
	else return false;
}
bool kt(int n){
	int t=0;
	while(n!=0){
		t=t+n%10;
		n=n/10;
	}
	if(nt(t)==true) return true;
	else return false; 
}
int main(){
	int n,i;
	cin>>n;
	for(i=1;i<=n;i++){
	if(kt(i)==true) cout<<i<<" ";
}
}

# data[].attributes.body
hhdang4

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n)
{
	int i,d=0;
	for(i=1;i<=n;i++)
	if(n%i==0) d=d+1;
	if(d==2) return true;
	else return false;
}
long long tong(long long k)
{
	long long t=0;
	while(k!=0)
	{
		t=t+k%10;
		k=k/10;
	}
	return t;
}
int main()
{
	int n,i;
	cin>>n;
	for(i=1;i<=n;i++)
	if(nt(tong(i))) cout<<i<<" ";
}

# data[].attributes.body
Thanh Tuyền

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
 bool SNT(long long m)
 {
  if(m<=1) return false;
   else
   {
    for(long i=2;i<=sqrt(m);i++)
	 if(m%i==0)
	 return false;
   }
	 return true;
}
	 int main()
	 {
	 	int  n;
	 	cin>>n;
	 	 if(SNT(n)==true) cout<<"N la so nguyen to";
	 	 if(SNT(n)==false) cout<<"N khong phai la so nguyen to";	 
	 }

# data[].attributes.body
#include<bits/stdc++.h>

using namespace std;

bool nto(long long h){

if(h<1) return false;

else

for(long long i=2;i<=h/2;i++)

if(h%i==0) return false;

return true;

}

int main (){

long long n;

cin>>n;

if(nto(n))

cout<<"yes";

else

cout<<"no";

}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
 bool SNT(long long m)
 {
  if(m<=1) return false;
   else
   {
    for(long i=2;i<=sqrt(m);i++)
	 if(m%i==0)
	 return false;
   }
	 return true;
 }  
	   int main()
	   {
		 int n;
		 cin>>n;
		 for(long i=2;i<=n;i++)
		  if(SNT(i))
		  cout<<i;  	
	  }
 	
 

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{
 int i,d=0;
 for(i=1;i<=n;i++)
  if(n%i==0)d=d+1;
  if(d==2)return true;
  else return false;
}
int main()
{
 int n,i;
 cin>>n;
 if(nt(n)==true)cout<<"la so nguyen to";
 else cout<<"NO";
}

# data[].attributes.body
#include<bits/stdc++.h>

using namespace std;

bool nto(long long h){

if (h<=1) return false;

else

for(long long i=2;i<=h/2;i++)

if(h%i==0) return false;

return true;

}

int main (){

long long n,d=0;

cin>>n;

for(long long i=2;i<=n/2;i++)

if (nto(i))

{

cout<<i<<" ";

d++;

}

cout<<endl<<"vay la co: "<<d<<" so nguyen to";

}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
 bool SNT(long long m)
 {
  if(m<=1) return false;
   else
   {
    for(long i=2;i<=sqrt(m);i++)
	 if(m%i==0)
	 return false;
   }
	 return true;
}
	 int main()
	 {
	 	int n;
	 	cin>>n;
	 	int x=n+1;
	 	 while(!SNT(x)) x++;
	 	  cout<<x;
	 	  return 0;
	 }

# data[].attributes.body
#include<bits/stdc++.h>

using namespace std;

bool nto(long long h){

if (h<=1) return false;

else

for(long long i=2;i<=h/2;i++)

if(h%i==0) return false;

return true;

}

int main(){

long long n;

cin>>n;

n++;

while (nto(n)==false)

n++;

cout<<n;

}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;

bool snt(long long n){
   
   if (n <= 1) return false;
   else {
   	for (int i = 2;i < n;i++)
   	     if (n % i == 0) return false;
   	    return true;
   }
   
}

int main(){
	
	long long n;
	cin>>n;
     for (int i = 1;i <= n;i++)
     if (snt(i)) cout<< i << "\n";
}

# data[].attributes.body
#include<bits/stdc++.h>

using namespace std;

bool nto(long long h){

if (h<=1) return false;

else

for(long long i=2;i<=h/2;i++)

if(h%i==0) return false;

return true;

}

long long tong(long long k){

long t=0;

while (k>0){

t+=k%10;

k=k/10;

}

return t;

}

int main (){

long long n,d=0;

cin>>n;

for(long long i=2;i<=n;i++)

if(nto(tong(i)))

cout<<i<<" ";

}

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;

bool snt(long long n){
   
   if (n <= 1) return false;
   else {
   	for (int i = 2;i < n;i++)
   	     if (n % i == 0) return false;
   	    return true;
   }
   
}
bool tongs(long long n){
	int tong =0;
	while (n>0){
		tong += n %10;
		n = n /10;
	}
	return snt(tong);
}


int main(){
	
	long long n;

	cin>>n;
    for (int i=1;i<=n;i++)
    if (tongs(i)) cout << i;
    
     	 
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(long long n)
{
 int i,d=0;
 for(i=1;i<=n;i++)
  if(n%i==0)d=d+1;
  if(d==2)return true;
  else return false;
}
bool kt(long long n)
{
 	 int t=0,x;
 	 while(n!=0)
 	  {
 	    x=n%10;
    	t=t+x;
    	n=n/10;
	}
	return t;
}
int main()
{
 	int x,n,i;
 	cin>>n;
 	for(i=1;i<=n;i++) 
 	if(nt(kt(x))==true)cout<<x;
}

# data[].attributes.body
minha 2

# data[].attributes.body
minha 4

# data[].attributes.body
minha 3

# data[].attributes.attachment_link.readable_text
#include <bits/stdc++.h>
using namespace std;
bool snt(int n) {
	int d=0;
	for (int i=1;i<=n;i++) 
	   if (n%i==0) d+=1;
	   if (d==2) return true;
	   else return false;
}
int main() {
	int n,d=0;
	cin >> n;
	while (snt(n)==false) {
		n+=1;
		for (int i=1; i<=n; i++)
			if(snt(n));
	}
	cout << n;
}

# data[].attributes.body
cao sieu

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(long long n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	int n,i=2;
	cin>>n;
	while(n!=1)
	{
		if(snt(i)==true)
		{
		if(n%i==0)
		{
			n=n/i;
			cout<<i;
			if(n!=1) cout<<"*";
			
		}
		else i++;
		}
		else i++;
	}
}

# data[].attributes.body
cao sieu

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(long long n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	long long n;
	cin>>n;
	for(int i=0;i<=n;i++)
		for(int j=0;j<=n;j++)
		if(snt(i) && snt(j) && i+j==n)
		cout<<i<<" "<<j<<endl;
}

# data[].attributes.body
cao sieu

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(long long n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	long long n;
	cin>>n;
	for(int i=2;i<=n;i++)
	 if(snt(i)) cout<<i<<" ";
}

# data[].attributes.body
cao sieu

# data[].attributes.body
bài 1_5

# data[].attributes.body
bài 1_6

# data[].attributes.attachment_link.readable_text
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
// Function to check if a number is prime
bool isPrime(int n) {
    if (n <= 1) return false;
    if (n <= 3) return true;
    if (n % 2 == 0 || n % 3 == 0) return false;
    for (int i = 5; i * i <= n; i = i + 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    return true;
}

int main() {
    int num;
    cin >> num;

    if (num <= 2 || num % 2 != 0) {
    	cout<<"Error";
        return 1;
    }

    bool found = false;
    for (int i = 2; i <= num / 2; ++i) {
        if (isPrime(i) && isPrime(num - i)) {
            cout << num<< "=" << i << " + " << (num - i) << endl;
            found = true;
            break;
        }
    }

    if (!found) {
        cout << "Error" << num << "." << std::endl;
    }

    return 0;
}

# data[].attributes.body
bài 1_7

# data[].attributes.body
bài 1_8

# data[].attributes.body
hhdang 1.6

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n)
{
	int d=0;
	for(int i=1;i<=n;i++)
	if(n%i==0) d=d+1;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,x,y;
	cin>>n;
	for(x=2;x<=n;x++)
	for(y=x+1;y<=n;y++)
	if((x+y==n)and(nt(x)==true)and(nt(y)==true)) cout<<x<<'+'<<y<<endl;
}

# data[].attributes.body
hhdang 1.7

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n)
{
	int d=0;
	for(int i=1;i<=n;i++)
	if(n%i==0) d=d+1;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,i;
	cin>>n;
	for(i=1;i<=n;i++)
	if(nt(i)==true) cout<<i<<' ';
}

# data[].attributes.body
hhdang 1.8

# data[].attributes.body
1.7

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
 using namespace std;
  int main()
  {
  	int n,k;
  	cin>>n;
  	k=1;
  	 for(int i=1;i<=n;i++)
  	  k=k*i;
  	  cout<<k;
  	   return 0;
  }

# data[].attributes.attachment_link.readable_text
#include<iostream>
using namespace std;

bool kt(long n){
	if (n==2) return true;
	for (int i=2; i<n; i++){
		if (n/i==0) return false;
	}
	return true;
}

int main(){
	long n,tong,tam,dem;	
	cin>>n;
	tong=1;
	tam=n;
	while (tong!=n){
		for ( int i=2; i<n; i++){
			if (kt(i)==true){
		while (tam/kt(i)==0){
			tam=tam/i;
			cout<<i<<" "<<"*";
			tong=tong*i;
		}
}
	}
	}
	
}

# data[].attributes.body
1.5

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool snt(long long n)
{
	if(n<=1) return false;
	else
	{
		for(int i=2;i<=sqrt(n);i++)
			if(n%i==0) return false;
		return true;
	}
}
int main()
{
	int n,i=2;
	cin>>n;
	while(n!=1)
	{
		if(snt(i)==true)
		{
		if(n%i==0)
		{
			n=n/i;
			cout<<i;
			if(n!=1) cout<<"*";
			
		}
		else i++;
		}
		else i++;
	}
}

# data[].attributes.attachment_link.readable_text
#include<iostream>
using namespace std;

bool kt(long n){
	if (n==2) return true;
	for (int i=2; i<n; i++){
		if (n/i==0) return false;
	}
	return true;
}

int main(){
	long n,tong,tam,dem;	
	cin>>n;
	tong=1;
	tam=n;
	while (tong!=n){
		for ( int i=2; i<n; i++){
			if (kt(i)==true){
		while (tam/kt(i)==0){
			tam=tam/i;
			cout<<i<<" "<<"*";
			tong=tong*i;
		}
}
	}
	}
	
}

# data[].attributes.body
1.6

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
bool nt(int n)
{
	int d=0;
	for(int i=1;i<=n;i++)
	if(n%i==0) d=d+1;
	if(d==2) return true;
	else return false;
}
int main()
{
	int n,x,y;
	cin>>n;
	for(x=2;x<=n;x++)
	for(y=x+1;y<=n;y++)
	if((x+y==n)and(nt(x)==true)and(nt(y)==true)) cout<<x<<'+'<<y<<endl;
}

# data[].attributes.attachment_link.readable_text
#include<iostream>
using namespace std;

bool kt(long n){
	if (n==2) return true;
	for (int i=2; i<n; i++){
		if (n/i==0) return false;
	}
	return true;
}

int main(){
	long n,tong,tam,dem;	
	cin>>n;
	tong=1;
	tam=n;
	while (tong!=n){
		for ( int i=2; i<n; i++){
			if (kt(i)==true){
		while (tam/kt(i)==0){
			tam=tam/i;
			cout<<i<<" "<<"*";
			tong=tong*i;
		}
}
	}
	}
	
}

# data[].attributes.attachment_link.readable_text
#include<bits/stdc++.h>
using namespace std;
 bool SNT(long long m)
 {
  if(m<=1) return false;
   else
   {
    for(long i=2;i<=sqrt(m);i++)
	 if(m%i==0)
	 return false;
   }
	 return true;
}
	 int main()
	 {
	 	int  n;
	 	cin>>n;
	 	 if(SNT(n)==true) cout<<"N la so nguyen to";
	 	 if(SNT(n)==false) cout<<"N khong phai la so nguyen to";	 
	 }
