/*******************************************************************************/
/* Computes the sum of all the prime numbers from 2-SIZE                       */
/*******************************************************************************/  
#include<iostream>
using namespace std;

int main()
{
    const int SIZE = 200;
    int sum = 0; //initialize
    bool prime;
    int fact; 
    for (int n = 2; (n <= SIZE); n++)
    {
         prime = true;
         fact = 2;
         while ( (fact <= n/2)  && prime    )
         {  
            if (n % fact == 0 )
                prime = false;
             else
                fact++;
         }//inner while
         
         if (prime)
            sum = sum + n;
         
        
     }//while
    
    cout << sum <<endl;  
   
   
       
    system("pause");
    return 0;
}