#include <iostream>
#include <string>
#include <iterator>
#include <algorithm>
#include <vector>
int main()
{
std::vector<std::string> words;
std::copy( std::istream_iterator<std::string>(std::cin),
std::istream_iterator<std::string>(),
std::back_inserter( words ) );
if( words.size() ) {
auto it = std::max_element( words.begin(), words.end(),
[]( const auto &s1, const auto &s2 ) {
return s1.length() < s2.length();
} );
std::cout << "index of first longest word " << *it << " is "
<< std::distance( words.begin(), it ) << std::endl;
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8aXRlcmF0b3I+CiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDx2ZWN0b3I+CgppbnQgbWFpbigpCnsKICAgIHN0ZDo6dmVjdG9yPHN0ZDo6c3RyaW5nPiB3b3JkczsKICAgIHN0ZDo6Y29weSggc3RkOjppc3RyZWFtX2l0ZXJhdG9yPHN0ZDo6c3RyaW5nPihzdGQ6OmNpbiksIAogICAgICAgICAgICAgICBzdGQ6OmlzdHJlYW1faXRlcmF0b3I8c3RkOjpzdHJpbmc+KCksCiAgICAgICAgICAgICAgIHN0ZDo6YmFja19pbnNlcnRlciggd29yZHMgKSApOwoKICAgIGlmKCB3b3Jkcy5zaXplKCkgKSB7CiAgICAgICAgIGF1dG8gaXQgPSBzdGQ6Om1heF9lbGVtZW50KCB3b3Jkcy5iZWdpbigpLCB3b3Jkcy5lbmQoKSwKICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIFtdKCBjb25zdCBhdXRvICZzMSwgY29uc3QgYXV0byAmczIgKSB7CiAgICAgICAgICAgICByZXR1cm4gczEubGVuZ3RoKCkgPCBzMi5sZW5ndGgoKTsKICAgICAgICAgfSApOwogICAgICAgICBzdGQ6OmNvdXQgPDwgImluZGV4IG9mIGZpcnN0IGxvbmdlc3Qgd29yZCAiIDw8ICppdCA8PCAiIGlzICIgCiAgICAgICAgICAgICAgICAgICA8PCBzdGQ6OmRpc3RhbmNlKCB3b3Jkcy5iZWdpbigpLCBpdCApIDw8IHN0ZDo6ZW5kbDsKICAgIH0KfQ==