Resursive prime

#include<stdio.h>
int prime(int x, int y, int count)
{
    if(y<=x)
    {
       if(x%y==0)
       {
           count++;
       }
       y++;
       return prime(x,y,count);
    }
    return count;
}
int main()
{
    int n,res;
    scanf("%d",&n);
    res=prime(n,1,0);
    if(res<=2)
    {
        printf("Prime");
    }
    else
    {
        printf("Not Prime");
    }
}