public static int smallaset_index1(int[] vec)
        {
            int J,small,index;
            small=vec[0];
            index=0;
            for (J=1;J<vec.Length;J++)
            {
                if (vec[J] > small)
                {
                    small = vec[J];
                    index = J;
                }
            }
            return J;
        }
        public static int smallaset_index2(int[] vec, int not)
        {
            int J, small, index;
                small = vec[0];
                index = 0;
            for (J = 0; J < vec.Length; J++)
            {
                if (J != not)
                {
                    if (vec[J] > small)
                    {
                        small = vec[J];
                        index = J;
                    }
                }
            }
            return index;
        }
        public static bool check_num(int[] vec, int num)
        {
            int J=0,I;
            bool Flag=false;
            while ((J < vec.Length) && (!Flag))
            {
                if (vec[J] != num)
                {
                    I=0;
                    while ((I < vec.Length) && (!Flag))
                    {
                        if (vec[J]+vec[I]==num)
                            Flag=true;
                        I++;
                    }
                }
                J++;
            }
            return Flag;
        }
        public static bool peula(int[] vec)
        {
            not1 = smallaset_index1(vec);
            not2 = smallaset_index2(vec);
            int I=0,J=0;;
            while (I < vec.Length)
            {
                if ((I != not1) && (I != not2))
                {
                    if (check_num(vec, vec[I]))
                        J++;
                }
            }
            return (J == vec.Length - 2);
        }