luncadiana_2.cpp

#include <iostream>
using namespace std;


int main()
{
 int n, aux, gasit, prim;
 cout<<"n=" ; cin>>n;
 aux=n-2;
 while(gasit=0)
  {int walker=2;
   do { if (aux%walker==0)  { flag=1;
                                      break;}
            walker=walker+1;
      } while (walker<=aux/2);

if (gasit==0) { aux=prim }

}
if(aux=prim)
{
 if(n-aux=prim)   {

    gasit=0;
    break;
 } else {
     aux=aux-1;
 }

}
}