Write a Pascal program that finds the smallest multiple of 3, with at least 1000 numbers.

The task contains a condition for the number of numbers to be checked. Namely: there must be at least 1000 of them.
Therefore, we will create an array of thousands of elements, and since it will be inconvenient and time-consuming to enter these numbers by hand, we will generate them with a function.
Create an array with 1000 elements:
mas: array [1..1000] of integer;
Fill the array with random integers:
for i: integer: = 1 to 1000 do
begin
mas [i]: = random (1000);
The array is full. Now let’s check if each element is divisible by three. We will use a double condition:
if (mas [i] mod 3 = 0) and (mas [i]> max)
max: = mas [i];
end;