public  int findPin(int input1, int input2, int input3, int input4) {
        int smallestDigit = Integer.MAX_VALUE;
        int largestDigit2 = 0;
        int largestDigit3 = 0;

        int temp1 = input1;
        while (temp1 != 0) {
            int digit = temp1 % 10;
            smallestDigit = Math.min(smallestDigit, digit);
            temp1 /= 10;
        }
        int temp2 = input2;
        while (temp2 != 0) {
            int digit = temp2 % 10;
            largestDigit2 = Math.max(largestDigit2, digit);
            temp2 /= 10;
        }
        int temp3 = input3;
        while (temp3 != 0) {
            int digit = temp3 % 10;
            largestDigit3 = Math.max(largestDigit3, digit);
            temp3 /= 10;
        }
        int PIN = (smallestDigit * largestDigit2 * largestDigit3) + input4;

        return PIN;
    }

#include <iostream>
#include <cmath>
#include <algorithm>

int solution(int M, int N) {
    int total_area = 4 * N + M;

    int x = static_cast<int>(:sqrt(total_area));

    while (x > 0) {
        int needed_tiles = x * x;

        int max_2x2_tiles = (x / 2) * (x / 2);

        if (needed_tiles <= 4 * min(N, max_2x2_tiles) + M) {
            return x;
        }

        --x;
    }

    return 0;
}

def foodItems(i1, i2, i3, i4):
    a = sorted(i4)
    if a[-1] - a[0] > i1 - 1:
        return -1
    m, c = 1, a[0]
    for x in a[1:]:
        if x - c > i1 - 1:
            m += 1
            c = x
    return m