#include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
*/
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
using namespace boost::multiprecision;
*/
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
#ifdef LOCAL_DEV
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << ":" << __LINE__ << " (" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = (ll)1e9 + 7; //INT_MAX = (1<<31)-1 = 2147483647
constexpr ll INF = (ll)1e18; //(1LL<<63)-1 = 9223372036854775807
constexpr ll MOD = (ll)1e9 + 7; //primitive root = 5
//constexpr ll MOD = 998244353; //primitive root = 3
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/

// Sparse Table
template<class MeetSemiLattice>
class SparseTable {
public:
	vector<vector<MeetSemiLattice> > dat;
	vector<int> height;
	
	SparseTable() { }
	SparseTable(const vector<MeetSemiLattice> &vec) { init(vec); }
	void init(vector<MeetSemiLattice> &vec) {
		int n = (int)vec.size(), h = 0;
		while ((1<<h) < n) ++h;
		dat.assign(h, vector<MeetSemiLattice>(1<<h));
		height.assign(n+1, 0);
		for (int i = 2; i <= n; i++) height[i] = height[i>>1]+1;
		for (int i = 0; i < n; ++i) dat[0][i] = vec[i];
		for (int i = 1; i < h; ++i)
			for (int j = 0; j < n; ++j)
				dat[i][j] = min(dat[i-1][j], dat[i-1][min(j+(1<<(i-1)),n-1)]);
	}
	
	MeetSemiLattice get(int a, int b) {
		return min(dat[height[b-a]][a], dat[height[b-a]][b-(1<<height[b-a])]);
	}
};
 
/*
SuffixArray(str):= 文字列 str の接尾辞配列を構築する。
lower_upper_bound(t):= 文字列 t を含む接尾辞のindexの下限と上限(半開区間)を返す。
空文字列が入っていない実装なので注意すること。
*/
class SuffixArray {
public:
	vector< int > SA;
	string s;

	SuffixArray(const string &str) : s(str) {
		int sz = s.size();
		SA.resize(sz);
		iota(begin(SA), end(SA), 0);
		sort(begin(SA), end(SA), [&](int a, int b) {
			return s[a] == s[b] ? a > b : s[a] < s[b];
		});
		vector< int > classes(sz), c(s.begin(), s.end()), cnt(sz);
		for(int len = 1; len < sz; len <<= 1) {
			for(int i = 0; i < sz; i++) {
				if(i > 0 && c[SA[i - 1]] == c[SA[i]] && SA[i - 1] + len < sz && c[SA[i - 1] + len / 2] == c[SA[i] + len / 2]) {
					classes[SA[i]] = classes[SA[i - 1]];
				} else {
					classes[SA[i]] = i;
				}
			}
			iota(begin(cnt), end(cnt), 0);
			copy(begin(SA), end(SA), begin(c));
			for(int i = 0; i < sz; i++) {
				int s1 = c[i] - len;
				if(s1 >= 0) SA[cnt[classes[s1]]++] = s1;
			}
			classes.swap(c);
		}
	}

	int operator[](int k) {
		return SA[k];
	}

	size_t size() {
		return s.size();
	}

	bool lt_substr(const string &t, int si = 0, int ti = 0) {
		int sn = (int) s.size(), tn = (int) t.size();
		while(si < sn && ti < tn) {
			if(s[si] < t[ti]) return true;
			if(s[si] > t[ti]) return false;
			++si, ++ti;
		}
		return si >= sn && ti < tn;
	}

	int lower_bound(const string &t) {
		int low = -1, high = (int) SA.size();
		while(high - low > 1) {
			int mid = (low + high) / 2;
			if(lt_substr(t, SA[mid])) low = mid;
			else high = mid;
		}
		return high;
	}

	pair< int, int > lower_upper_bound(string &t) {
		int idx = lower_bound(t);
		int low = idx - 1, high = (int) SA.size();
		t.back()++;
		while(high - low > 1) {
			int mid = (low + high) / 2;
			if(lt_substr(t, SA[mid])) low = mid;
			else high = mid;
		}
		t.back()--;
		return {idx, high};
	}

	void output() {
		for(int i = 0, sz = size(); i < sz; i++) {
			cout << i << ": " << s.substr(SA[i]) << endl;
		}
	}
};

/*
LongestCommonPrefixArray(SA):= 接尾辞配列 SA をもとに高さ配列を構築する。
高さ配列＝接尾辞配列 SA における隣同士の接尾辞で、先頭何文字が共通しているかを表す配列
*/
class LongestCommonPrefixArray {
public:
	SuffixArray &SA;
	vector< int > LCP, rank;
	SparseTable< int > st;

	LongestCommonPrefixArray(SuffixArray &SA) : SA(SA), LCP(SA.size()) {
		int sz = SA.size();
		rank.resize(sz);
		for(int i = 0; i < sz; i++) {
			rank[SA[i]] = i;
		}
		for(int i = 0, h = 0; i < sz; i++) {
			if(rank[i] + 1 < sz) {
				for(int j = SA[rank[i] + 1]; max(i, j) + h < sz && SA.s[i + h] == SA.s[j + h]; ++h);
				LCP[rank[i] + 1] = h;
				if(h > 0) --h;
			}
		}
		st.init(LCP);
	}

	// lcp of str.sutstr(a) and str.substr(b)
	// 文字strのa文字目からとb文字目からで何文字共通しているか
	int getLCP(int a, int b) {
		return st.get(min(rank[a], rank[b]) + 1, max(rank[a], rank[b]) + 1);
	}

	int operator[](int k) {
		return LCP[k];
	}

	size_t size() {
		return LCP.size();
	}

	void output() {
		for(int i = 0, sz = size(); i < sz; i++) {
			cout << i << ": " << LCP[i] << " " << SA.s.substr(SA[i]) << endl;
		}
	}
};

/*-----8<-----library-----8<-----*/

constexpr ll N_MAX = 500'000;

string S;

void solve() {
	cin >> S;
	ll N=S.size();

	SuffixArray sa(S);
	LongestCommonPrefixArray lcpa(sa);

	ll ans = N*(N+1)/2;
	rep(i,lcpa.size())ans -= lcpa[i];
	
	cout << ans << '\n';
}

// https://atcoder.jp/contests/practice2/tasks/practice2_i
signed main() {
	std::cin.tie(nullptr);
	std::ios::sync_with_stdio(false);
	//ll Q; cin >> Q; while(Q--)solve();
	solve();
	return 0;
}


Measured memory_bytes: 50908