import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    string s;
    scan(s);
    int n = s.length.to!int + 1;
    s = ">" ~ s ~ "<";

    auto a = new int[](n);
    a[] = inf;

    int rec(int i) {
        debug {
            writeln("i: ", i);
        }
        if (a[i] != inf) {
            return a[i];
        }
        a[i] = 0;
        if (s[i] == '<') {
            chmax(a[i], rec(i - 1) + 1);
        }
        if (s[i + 1] == '>') {
            chmax(a[i], rec(i + 1) + 1);
        }
        return a[i];
    }

    long ans;

    foreach (i ; 0 .. n) {
        ans += rec(i);
    }

    debug {
        writeln(a);
    }

    writeln(ans);
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
