#include <algorithm>

#include <iostream>

#include <string>

using namespace std;



void main()

{

	string s;

	cout << "Enter a string: ";

	cin >> s;

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

	if (binary_search(s.begin(), s.end(), 'e'))

	{	pair<string::iterator, string::iterator> ret_val = equal_range(s.begin(), s.end(),'e');

		cout << endl << "Sorted string: " << s << endl;

		cout << "The range of e's begins at position " << (ret_val.first - s.begin()) << " and ends at "	

			  << (ret_val.second - s.begin()) << endl;

	}

}