function belkiss (x)
 numbers = {}
for i = 2, x do
    numbers[i] = i;
end
 for i = 2, x do
    for j = i+1, x do
        if numbers[j] ~= 0 and Math.Mod(j, i) == 0 then numbers[j] = 0 end
    end
end
max_prime_left, max_prime_right = 2, 2
for i = 2, x do
    if numbers[i] ~= 0 then 
        local is_prime = true
 
        local l = math.floor( i / 10 )
        while l > 1 do
            if numbers[l] == 0 then
                is_prime = false
                break 
            end
            l = math.floor( l / 10 )
        end
        if is_prime then
            max_prime_left = i
        end
         is_prime = true
        local n = 10;
        while math.floor(Math.Mod(i, 10) ) ~= 0 and n < x do
            if numbers[ math.floor( Math.Mod(i, 10) ) ] ~= 0 then
                is_prime = false
                break
            end
            n = n * 10
        end    
        if is_prime then
            max_prime_right = i
        end
    end
end
end

x=Input.GetText("Input1");
x = String.ToNumber(x);
belkiss (x)
Input.SetText("Input2", max_prime_right);
Input.SetText("Input3", max_prime_left);

local n =10000
local prime = {}
local primes = {}

for i = 2, n do prime[i] = true end

for i = 2, n do
 if prime[i] then
   primes[#primes+1] = i
   for j = i*2, n, i do prime[j] = false end
 end
end


Input.SetText("Input1",table.concat(primes, " "));