function primdiv(n)
  assert(n ~= 0)
  if n < 0 then n = -n end
  local function f(_, v)
    if n > 1 then
      while n%v > 0 do
        v = v + (v == 2 and 1 or 2)
        if v*v > n then v = n end
      end 
      n = n / v
      return v
    end 
  end 
  return f,nil,2
end

Input.SetText("Input2", "");

my_table = {}

X=Input.GetText("Input1");
X = String.ToNumber(X);

i = 1

for p in primdiv(X) do

Table.Insert(my_table, i, p);

i = i + 1

end

---------------------------------

for x,y in pairs (my_table) do

result = Input.GetText("Input2");

Input.SetText("Input2", result .. " , " .. y);

end

        function primdiv(n)
  if n < 0 then n = -n end
  local function f(_, v)
    if n > 1 then
      while n%v > 0 do
        v = v + (v == 2 and 1 or 2)
        if v*v > n then v = n end
      end 
      n = n / v
      return v
    end 
  end 
  return f,nil,2
end

function primdiv(n)
  if n < 0 then n = -n end
  local function f(_, v)
    if n > 1 then
      while Math.Mod(n, v) > 0 do
        v = v + (v == 2 and 1 or 2)
        if v*v > n then v = n end
      end 
      n = n / v
      return v
    end 
  end 
  return f,nil,2
end

  local function f(_, v)