7.10

#include<iostream>
#include<cmath> 
using namespace std;
typedef long long ll;
int start, len;//序列开始因子和连续因子个数  
int main()
{
    cin.tie(0);
    ll N;
    cin >> N;
    int start = 0, len = 0;
    for(int i = 2; i <= sqrt(N); i++ )
    {
        int j = i, sum = 0;
        int n = N;
        while(n % j == 0)
        {
            n = n / j;
            j ++;
            sum ++ ;
        }
        
        if(sum > len)
        {
            start = i;
            len = sum; //更新个数 
        } 
    }
    if(start == 0)//N是质数，只有自己一个因子 
    {
        start = N;
        len = 1;
    }
    cout << len << endl << start;//输出长度和第一个连续因子 
    for(int i = start + 1; i < start + len; i++) 
    cout << "*" << i;
    
    return 0; 
}