#include <bits/stdc++.h> // 3nd sub

const int N = 1e5 + 5;
const int mod = 998244353;

int n, vis[N], dx[128], dy[128];
char s[N];

int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	dx['U'] = dy['L'] = -1, dx['D'] = dy['R'] = 1;
	int res = 0;
	for (int i = 1; i <= n; ++i) {
		int len = -1, lim = i - 2;
		for (int j = i; j + 1 <= n; j += 2) {
			if (s[j] == 'R' && s[j + 1] == 'L') ++res, lim = j + 1;
			else {
				if (s[j] == 'L' || s[j] == 'U') len = -1;
				else {
					int nxt = -1;
					for (int k = j; k <= n; ++k)
						if (s[k] == 'U') { nxt = k; break; }
					if (nxt == -1) len = -1;
					else if (s[j] == 'R') len = nxt - j;
					else {
						int t = j;
						while (s[t + 1] == 'L') ++t;
						len = nxt - t;
					}
				}
				break;
			}
		}
		if (len == -1) continue;
		memset(vis, 0, sizeof(vis));
		int ok = 1;
		for (int j = i, r = 1; j + len - 1 <= n; j += len, ++r) {
			int flag = 0;
			for (int k = 1; k <= len; ++k) {
				if (s[j + k - 1] == 'D') flag = 1;
				int x = r + dx[s[j + k - 1]], y = k + dy[s[j + k - 1]];
				if (y < 1 || y > len || x < 1 || vis[(x - 1) * len + y]) ok = 0;
				vis[(x - 1) * len + y] = 1;
			}
			if (j + len - 1 > lim && ok && !flag) ++res;
		}
	}
	printf("%d\n", res);
	return 0;
}