		#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <climits>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define in insert
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define f first
#define s second
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define int ll
#define sz(x) (ll)x.size()
#define all(x) (x.begin(),x.end())
using namespace std;

 
const ll INF = 1e12;
const ll N =(1e5+5); // TODO : change value as per problem
const ll MOD = 1e9+7;


void solve(){
	string s;
	cin >> s;
	int ans = 0;
	map<char,int> m;
	for(int i =s.size()-1;i>=0;i--){
		for(char c = 'a';c<='z';c++){
			if(c != s[i]){
				ans += m[c];
			}
		}
		m[s[i]]++;
	}
	ans++;
	cout << ans << endl;
}
signed main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
     // freopen(".in","r",stdin);freopen(".out","w",stdout);
    
     ll tt=1;   
     // cin >> tt;
    while(tt--){    
        solve();
    }    
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
#include <unordered_map>
#include <math.h>
#define MOD 1000000007

using namespace std;

ifstream fin("../data.txt");

int x;

unordered_map<int, long long> factorization(int x) {
  unordered_map<int, long long> factors;
  while(x % 2 == 0) {
    factors[2]++;
    x /= 2;
  }

  for (int i = 3; i <= sqrt(x); i++) {
    while(x % i == 0) {
      factors[i]++;
      x /= i;
    }
  }

  if (x != 1) factors[x]++;
  // for (auto aux : factors) {
  //   cout << "(" <<  aux.first << ", " << aux.second << ") ";
  // }
  // cout << "\n";
  return factors;
}

int main() {

  cin >> x;
  unordered_map<int, long long> factors;
  for (int n = 2; n <= x; n++) {
    unordered_map<int, long long> currFactors = factorization(n);
    for (auto aux : currFactors) {
      factors[aux.first] += aux.second;
    }
  }

  long long ans = 1;
  for (auto aux : factors) {
    ans *= (aux.second + 1LL);
    ans %= MOD;
  }


  cout << ans;

  return 0;
}
