private int generateMostPossible()
        {
            int num = 0, i = 0, percent = 50, j = 1, k1 = 2, k2 = 4;

            if (mainLoto.Drawn.Count > 10)
            {
                int[] notDrawn = calculateNotDrawn(mainLoto.Drawn.Count);
                while (num == 0 && percent >= 10)
                {
                    if (mostFrequentPercent[i] >= percent && notDrawn[mostFrequent[i] - 1] >= j)
                    {
                        num = mostFrequent[i];
                        foreach (int a in generatedNumbers)
                        {
                            if (num == a)
                            {
                                num = 0; break;
                            }
                        }
                    }
                    else if (mostFrequentPercent[i] >= 60 && !mainLoto.checkIfDrawn(mostFrequent[i], 1) && mainLoto.checkIfDrawn(mostFrequent[i], 0))
                    {
                        num = mostFrequent[i];
                        foreach (int a in generatedNumbers)
                        {
                            if (num == a)
                            {
                                num = 0;
                                break;
                            }
                        }
                    }
                    else if (mostFrequentPercent[i] >= 50 && !mainLoto.checkIfDrawn(mostFrequent[i], 2) && !mainLoto.checkIfDrawn(mostFrequent[i], 1) && mainLoto.checkIfDrawn(mostFrequent[i], 0))
                    {
                        num = mostFrequent[i];
                        foreach (int a in generatedNumbers)
                        {
                            if (num == a)
                            {
                                num = 0;
                                break;
                            }
                        }
                    }
                    else if (percent > 40 && mostFrequentPercent[i] >= percent && mainLoto.countLastDraws(mostFrequent[i]) >= k1 && mainLoto.countLastDraws(mostFrequent[i]) < k2)
                    {
                        num = mostFrequent[i];
                        foreach (int a in generatedNumbers)
                        {
                            if (num == a)
                            {
                                num = 0;
                                break;
                            }
                        }
                    }
                    if (mostFrequentPercent[i] < percent)
                    {
                        percent -= 10; j++; i = 0; k1++; k2++;
                    }
                    else if (i < mostFrequent.Count - 1)
                    {
                        i++;
                    }
                    else
                    {
                        percent -= 10; j++; i = 0; k1--; k2--;
                    }
                }
                ;
            }
            while (num == 0)
            {
                foreach (int number in mostFrequent)
                {
                    num = number;
                    foreach (int ab in generatedNumbers)
                    {
                        if (ab == num)
                        {
                            num = 0; break;
                        }
                    }
                }
            }
            return(num);
        }