#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

int consistency1(int n){
	
	vector<vector<bool>> dp(n, vector<bool>(n, false));
	vector<vector<int>> dpCt(n, vector<int>(n, 0));
	
	for(int gap=0; gap<n; gap++){
		for(int i=0, j=gap; j<n; i++, j++){
			if(gap == 0){
				dp[i][j] = true;
				dpCt[i][j] = 1;
			}
			else if(gap == 1){
				if(a[i] == a[j]){
					dp[i][j] = true;
					dpCt[i][j] = 3;
				}
				else{
					dpCt[i][j] = 2;
				}
			}
			else{
				dpCt[i][j] = dpCt[i][j-1] + dpCt[i+1][j] - dpCt[i+1][j-1];
				if(a[i] == a[j] && dp[i+1][j-1]){
					dp[i][j] = true;
					dpCt[i][j]++;
				}
			}
		}
	}
	
	int ans = 0;
	for(int i=0; i<=n-2; i++){
		int j = i;
		int x = 0;
		while(j>=0){
			if(dp[j][i]) x++;
			j--;
		}
		int y = dpCt[i+1][n-1];
		
		ans += x*y;
	}
	
    return ans;
}







int consistency2(int n){
	
	vector<vector<bool>> dp(n, vector<bool>(n, false));
	vector<vector<int>> dpCt(n, vector<int>(n, 0));
	vector<int> dp2(n, 0);
	
	for(int gap=0; gap<n; gap++){
		for(int i=0, j=gap; j<n; i++, j++){
			if(gap == 0){
				dp[i][j] = true;
				dpCt[i][j] = 1;
				dp2[j] += 1;
			}
			else if(gap == 1){
				if(a[i] == a[j]){
					dp[i][j] = true;
					dpCt[i][j] = 3;
					dp2[j] += 1;
				}
				else{
					dpCt[i][j] = 2;
				}
			}
			else{
				dpCt[i][j] = dpCt[i][j-1] + dpCt[i+1][j] - dpCt[i+1][j-1];
				if(a[i] == a[j] && dp[i+1][j-1]){
					dp[i][j] = true;
					dpCt[i][j]++;
					dp2[j]++;
				}
			}
		}
	}
	
	
	int ans = 0;
	for(int i=0; i<=n-2; i++){
		int x = dp2[i];
		int y = dpCt[i+1][n-1];
		
		ans += x*y;
	}
	
    return ans;
}














int practice(int n){


    return 0;
}





void solve() {
    
    cin >> a;
    int n = a.size();
    cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}