#include <iostream>
#include <algorithm>
#include <string>
#ifdef USE_HASH_MAP
#ifdef __GNUC__
#include <ext/hash_map>
#define TR1EXT  ::__gnu_cxx::
#define TR1_BEGIN namespace __gnu_cxx {
#define TR1_END   }
#elif defined(_MSC_VER)
#include <hash_map>
#define TR1EXT _STDEXT
#define TR1_BEGIN _STDEXT_BEGIN
#define TR1_END   _STDEXT_END
#else
#include <tr1/hash_map>
#define TR1EXT ::tr1::
#define TR1_BEGIN namespace tr1 {
#define TR1_END   }
#endif

#define MAPTYPE TR1EXT hash_map
#else
#include <map>
#define MAPTYPE std::map
#endif


#include <vector>
#define NSTATES 50
char *states[NSTATES] =
{ 
"alabama",
"alaska",
"arizona",
"arkansas",
"california",
"colorado",
"connecticut",
"delaware",
"florida",
"georgia",
"hawaii",
"idaho",
"illinois",
"indiana",
"iowa",
"kansas",
"kentucky",
"louisiana",
"maine",
"maryland",
"massachusetts",
"michigan",
"minnesota",
"mississippi",
"missouri",
"montana",
"nebraska",
"nevada",
"newhampshire",
"newjersey",
"newmexico",
"newyork",
"northcarolina",
"northdakota",
"ohio",
"oklahoma",
"oregon",
"pennsylvania",
"rhodeisland",
"southcarolina",
"southdakota",
"tennessee",
"texas",
"utah",
"vermont",
"virginia",
"washington",
"westvirginia",
"wisconsin",
"wyoming",
};
typedef std::vector<int> IntVector;
typedef std::pair<int,int> IntPair;
typedef std::vector<IntPair> IntPairVector;

#if defined(USE_HASH_MAP)
TR1_BEGIN

size_t hash_value(const IntVector& v)
{
    size_t hash=v.size();
    for (IntVector::const_iterator i= v.begin() ; i!=v.end() ; ++i)
    {
        hash <<= 1;
        hash ^= *i;
    }
    return hash;
}
#ifdef __GNUC__
template<> struct hash<IntVector> {
    inline size_t operator()(const IntVector& v) const
    { return hash_value(v); }
};
#endif
TR1_END
#endif

typedef MAPTYPE<IntVector,IntPairVector> sigmap_t;
void add_to_sig(IntVector& sig, const std::string& str)
{
    for (std::string::const_iterator i= str.begin() ; i!=str.end() ; i++)
        sig[(*i)-'a']++;
}
bool test(bool bOutput)
{
    sigmap_t sigmap;
    for (int i= 0 ; i<NSTATES ; i++)
    for (int j= i+1 ; j<NSTATES ; j++) {
        IntVector sig; sig.resize(26);
        add_to_sig(sig, states[i]);
        add_to_sig(sig, states[j]);

        sigmap[sig].push_back(IntPair(i,j));
    }
    for (sigmap_t::iterator k= sigmap.begin() ; k!=sigmap.end() ; k++)
    {
        if ((*k).second.size()>1) {
            IntPairVector& p= (*k).second;
            if (bOutput) {
                std::cout << states[p[0].first] << ":" << states[p[0].second] << "\n";
                std::cout << states[p[1].first] << ":" << states[p[1].second] << "\n";
            }
            return true;
        }
    }
    return false;
}

int main(int argc, char **argv)
{
    for (int i=0 ; i<1000 ; i++)
        test(false);
}