#include<stdio.h>
int is_prime(int m);
int main(void){
    int i=1, count=0, n, coun, prime;
    FILE * fopen;
    fopen = fout("prime.txt","w");

    fprintf(fout,"Enter a value: %d",n);
    fscanf(fout,"%d",&n);
    fprintf(fout,"count    prime");

    i=1;
    count=0;
    while(count<n){
        if(is_prime(i)==1){
            count++;
            fprintf(fout,"5%d 5%d", coun, prime);
        }
        i++;
    }
    fclose(fout);
    return 0;
}

    int is_prime(int m)
    {
        int k, limit;
        int result;


        if (m == 1) {
            result = 0;           /* 1 is not prime                     */
        } else if (m == 2) {
            result = 1;           /* 2 is the only even prime           */
        } else if (m % 2 == 0) {
            result = 0;           /* even numbers > 2 are not prime     */
        } else {
            result = 1;           /* start off assuming that m is prime */
            limit = m/2;          /* check up to 1/2 of the number      */
            for( k = 3; k <= limit; k = k + 2 ){
                if( (m % k) == 0 ){
                    result = 0;
                    break;
                }
            }
        }


        return result;
    }