#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<sstream>
#include<iomanip>
#include <utility>
#include<map>
#include<set>
#include<iterator>
#include<stack>
#include<bitset>
#include<queue>
#include<deque>
#define all(v) ((v).begin()) , ((v).end())
#define sz(v) ((int)((v).size()))
using namespace std;
set<int> st;
set<int> ::iterator it;
map<char, int> mp;
map<char, int> ::iterator itr;
/*bool co(const pair<long long, long long>&c, const pair<long long, long long>&d)
{
return c.second > d.second;
} */
int arr[100000] = { 0 };
int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(NULL), cout.tie(NULL);
	int n, r, l, p = 0, e = 0, o = 0;
	string s, str;
	cin >> s >> n;
	for (int i = 0; i < n; i++) {
		cin >> r >> l;
		str = s.substr(r - 1, l - r + 1);
		sort(str.begin(), str.end());
		p = 0;
		arr[0] = 1;
		for (int j = 1; j < str.size(); j++) {
			if (str[j] == str[j - 1])
				arr[p]++;
			else {
				if (arr[p] % 2 == 0)
					e++;
				else o++;
				p++;
				arr[p]++;
			}
		}
		if (arr[p] % 2 == 0)
			e++;
		else o++;
		if (o == 0 && e != 0)
			cout << e << endl;
		else
			cout << min(e, o) * 2 << endl;
		e = 0, o = 0;

	}

}