#include <stdio.h>
#include <stdlib.h>
void result(int *found, int index);
void arraydump(int *array, int numElements);

void main(int argc, char *argv[]) {	

	int numPrimes;
	int thisPrime;
	unsigned int thisNum;
	thisNum=1;
	thisPrime=0;
	numPrimes=atoi(argv[1]);
	int *found;
	found = (int *) malloc(sizeof (int) * numPrimes);
	for (int i=0; i<numPrimes; i++) {
		found[i]=0;
	}

	while ( thisPrime < numPrimes ){
        int zerosFound;
        //arraydump(found,numPrimes);
		if (thisNum % 2 != 0) {
			if ( thisNum == 1) {
                found[thisPrime]=thisNum;
                result(found, thisPrime);
                thisPrime++;
			} else {
                int index;
                zerosFound=0;
                index=0;
				for (int y=0; y<numPrimes; y++) {
					if(found[y] > 0) {
						if (thisNum % found[y] == 0) {
                            zerosFound++;
                        }
                    }
                }
                if (zerosFound == 1) {
                    for (int x=0; x<numPrimes-1; x++) {
                        if (found [x+1] == 0) {
			                found[x+1] = thisNum;
				            result(found, x+1);
				            thisPrime++;
                            x=numPrimes;
                            zerosFound=0;	
                        }
                    }
			    }
            }
		} else {
			if ( thisNum == 2) {
				found[thisPrime]=thisNum;
				result(found, thisPrime);
				thisPrime++;
			}
			
		}	
		thisNum++;
	}
}

void arraydump(int *array, int numElements) {
    int val;
    for (int i=0; i<numElements; i++) {
        val=array[i];
        printf("%d=>%d\n",i,val);
    }
    printf("-------------------------\n");    
}

void result(int *found, int index){
	printf("The %dth prime is %d\n", index+1, found[index]); 
}