#include<stdio.h>

 #include<stack>

 #include<string.h>

 #include<iostream>

 #include<algorithm>

 #include<vector>

 using namespace std;

 class BinPackingEasy

 {

 private:

     int count;

 public:

     int minBins(vector <int> item)

     {

         count = ;

         int j;

         int len = item.size();

         int vis[len+];

         memset(vis,,sizeof(vis));

         sort(item.begin(),item.end());

         for(int i = len-; i >= ; i--)

         {

             if(vis[i]) continue;

             vis[i] = ;

             for(j = i-; j >= ; j--)

             {

                 if(item[i] + item[j] <=  && !vis[j])

                 {

                     vis[j] = ;

                     count++;

                     break;

                 }

             }

             if(j == -)

                 count++;

         }

         for(int i = ; i < len; i++)

             if(!vis[i])

                 count++;

         return count;

     }

 };