/*
СТРОИМ СТЕНУ РАБОТЯГИ!
█▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═█
█═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═╩═╦═█
█▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄█
*/
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
/** Interface */
     
inline int readChar();
template <class T = int> inline T readInt(); 
template <class T> inline void writeInt( T x, char end = 0 );
inline void writeChar( int x ); 
inline void writeWord( const char *s );
     
/** Read */
     
static const int buf_size = 4096;
     
inline int getChar() {
    static char buf[buf_size];
    static int len = 0, pos = 0;
    if (pos == len) {
        pos = 0, len = fread(buf, 1, buf_size, stdin);
    }
    if (pos == len) {
        return -1;
    }
    return buf[pos++];
}
     
inline int readChar() {
    int c = getChar();
    while (c <= 32) {
        c = getChar();
    }
    return c;
}
     
template <class T>
inline T readInt() {
    int s = 1, c = readChar();
    T x = 0;
    if (c == '-')
        s = -1, c = getChar();
    while ('0' <= c && c <= '9')
        x = x * 10 + c - '0', c = getChar();
    return s == 1 ? x : -x;
}
     
/** Write */
     
static int write_pos = 0;
static char write_buf[buf_size];
     
inline void writeChar( int x ) {
    if (write_pos == buf_size)
        fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
    write_buf[write_pos++] = x;
}
     
template <class T> 
inline void writeInt( T x, char end ) {
    if (x < 0)
        writeChar('-'), x = -x;
     
    char s[24];
    int n = 0;
    while (x || !n)
        s[n++] = '0' + x % 10, x /= 10;
    while (n--)
        writeChar(s[n]);
    if (end)
        writeChar(end);
}
     
inline void writeWord( const char *s ) {     while (*s)
writeChar(*s++); }
     
struct Flusher {
    ~Flusher() {
        if (write_pos)
            fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
    }
} flusher;
   
   
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228
const int MAXN = 200001;
const int M = 1000000007;
const int P = 424243;


int h[MAXN], h1[MAXN];
int p[MAXN];
string s;


int gethash(int l, int r) {
    return (h[r] - (l ? 1LL * h[l - 1] * p[r - l + 1]: 0) % M + M) % M;
}

int gethash1(int l, int r) {
    return (h1[r] - (l ? 1LL * h1[l - 1] * p[r - l + 1]: 0) % M + M) % M;
}


int getrhash(int l, int r) {
    return gethash1(sz(s) - r - 1, sz(s) - l - 1);
}


int cnt[26];


int main() {
    cin >> s;
    for (int i = 0; i < sz(s); i++) {
        cnt[s[i] - 'a']++;
    }
    long long ans = 1 + (1LL * sz(s) * (sz(s) + 1)) / 2LL;
    for (int i = 0; i < 26; i++) {
        ans -= (1LL * cnt[i] * (cnt[i] + 1)) / 2LL;
    }
    cout << ans << endl;
    // p[0] = 1;
    // for (int i = 1; i <= sz(s); i++) {
    //     p[i] = (1LL * p[i - 1] * P) % M;
    // }
    // h[0] = s[0];
    // for (int i = 1; i < sz(s); i++) {
    //     h[i] = (1LL * h[i - 1] * P + s[i]) % M;
    // }
    // reverse(all(s));
    // h1[0] = s[0];
    // for (int i = 1; i < sz(s); i++) {
    //     h1[i] = (1LL * h1[i - 1] * P + s[i]) % M;
    // }
    // reverse(all(s));
    // long long ans = 1 + (1LL * sz(s) * (sz(s) + 1)) / 2LL;
    // for (int i = 0; i < sz(s); i++) {
    //     int l = 1;
    //     int r = min(i + 1, sz(s) - i);
    //     while (l != r) {
    //         int mid = (l + r + 1) >> 1;
    //         if (gethash(i, i + mid - 1) != getrhash(i - mid + 1, i)) {
    //             r = mid - 1;
    //         } else {
    //             l = mid;
    //         }
    //     }
    //     ans -= l;
    // }
    // cout << ans << endl;
    // for (int i = 0; i < sz(s) - 1; i++) {
    //     if (s[i] != s[i + 1]) {
    //         continue;
    //     }
    //     int l = 1;
    //     int r = min(i + 1, sz(s) - i - 1);
    //     while (l != r) {
    //         int mid = (l + r + 1) >> 1;
    //         if (gethash(i + 1, i + mid) != getrhash(i - mid + 1, i)) {
    //             r = mid - 1;
    //         } else {
    //             l = mid;
    //         }
    //     }
    //     ans -= l;
    // }
    // cout << ans << endl;
    return 0;   
}


Measured memory_bytes: 640