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


void main() {
    int n;
    int[] a;

    scan(n);
    a = readln.split.to!(int[]);

    int[] pos = new int[](n + 2);

    foreach (int i, ai; a) {
        pos[ai] = i + 1;
    }

    debug {
        writeln("pos:", pos);
    }

    auto rbt = redBlackTree(0, n + 1);
    long ans;

    foreach (i ; 1 .. n + 1) {
        int prev = rbt.lowerBound(pos[i]).back;
        int next = rbt.upperBound(pos[i]).front;

        debug {
            writefln("prev:%d, next:%d", prev, next);
        }

        ans += 1L * i * (pos[i] - prev) * (next - pos[i]);

        rbt.insert(pos[i]);
    }

    writeln(ans);
}



struct Stack(T) {
private:
    int N, peek;
    T[] data;

public:
    this(int size) 
    {
        N = size;
        data = new T[](N);
    }

    bool empty() @property
    {
        return peek == 0;
    }

    bool full() @property
    {
        return peek == N;
    }

    void push(T x) @property
    {
        assert(!full);
        data[peek++] = x;
    }

    void pop() @property
    {
        assert(!empty);
        --peek;
    }

    T top() @property
    {
        return data[peek - 1];
    }

    void clear() @property
    {
        peek = 0;
    }

    int length() @property
    {
        return peek;
    }

}



void scan(T...)(ref T args) {
    string[] 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);
        }
    }
}