Finding all prime factors in minimum time complexity

//find all prime factors
#include <iostream>
#include<math.h>
using namespace std;

int main() {
    int n;
    cin>>n;
    cout<<n<<endl;
    int count=0;
    for(int i=2;i<=n;i++)
    {
        count =0;
        while(n%i==0){
            n/=i;
            count++;
        }
        if(count)
            cout<<i<<"<<"<<count<<endl;
    }
    
 return 0;
}