#include<algorithm>
#include<map>
class Solution {
public:
bool hasGroupsSizeX(vector<int>& deck) {
int l = deck.size();
if(l<2)return false;
map<int,int> num;
for(int i=0;i<l;i++)
{
num[deck[i]]++;
}
for(int x=2;x<=l;x++)
{
if(l%x!=0)continue;
else
{ map<int,int>::iterator it;
bool all =true;
for(it=num.begin();it!=num.end();it++)
{
cout<<it->first<<" "<<it->second<<" ";
if(it->second%x!=0)
{
all = false;
break;
}
}
cout<<endl;
if(all)return true;
}
}
return false;
}
};