Pascal programming problem

I don't write pascal but i write C++

The logic should be the same and the syntax should be relatively easy to understand.

void prime(int input)
{
int newnum = input;
int factor = 2;// first prime factor to check is 2.

while (factor * factor <= newnum)
{
if (newnum % factor == 0) //check if the number can be divided by the factor
{
cout << factor //print out the factor
newnum = newnum/factor;
}
else
{
factor++; // try the next possible factor if the number cannot be divided
}
}
}