#include <iostream>
#include "list.h"

using namespace std;
int MAX_LENGTH = 50;

int main () {
    List primes;
    int i,k;

    // To find prime numbers up to N (50), form a list of all numbers up 
    // to N, then start deleting multiples of primes.

   for(i=2;i<MAX_LENGTH;i++) {
      primes.Insert(i);
   }

   for(i=2; i< MAX_LENGTH;i++) {
       if (primes.IsPresent(i)) {
           for (k=2;i*k<=MAX_LENGTH;k++) {
               primes.Delete(i*k);
           }
       }
   }  

   primes.Print();
   cout << endl;
}