res = ceil(sqrt(x));
if x == 2
    result = 'Prime';
elseif mod(x,2) == 0
    result = 'Non-Prime';
elseif mod(x, res) ~= 0
    result = primeCheck(res);
end
end