function find_factor_f_in_n (n : integer) : integer;
  var 
    f : integer;
  begin
    f := 2;
    while ((n mod f) <> 0) and (n > f) do
      f := f + 1;
    if f > n then
      f := n;
    find_factor_f_in_n := f
  end;

var
  f , n : integer;

begin
  readln(n);
  write(n,' = ');
  repeat
    f := find_factor_f_in_n(n);
    write(f);
    n := n div f;
    if (n > 1) then
      write('*')
  until n = 1;
  writeln
end.