#include "bits/stdc++.h"

using namespace std;

#define rep(loop, N) for (int loop = 0; loop < N; loop++)

struct Node {
	Node* parent = NULL;
	vector<Node*> child;
	long long value = 0;
};
struct Edge {
	int parent = 0;
	int child = 0;
	bool operator <(const Edge& right) const { return parent < right.parent; }
};
struct Tree {
	vector<Node> node;
	Tree(int, vector<Edge>);
};
Tree::Tree(int nodeNum, vector<Edge> edge) {
	node.resize(nodeNum);
	for (Edge& it : edge) {
		node[it.child].parent = &node[it.parent];
		node[it.parent].child.push_back(&node[it.child]);
	}
}

map<long long, int> factorization(long long N) {
	map<long long, int> re;
	while (true) {
		if (N % 2 == 0) {
			N /= 2;
			re[2]++;
			if (N == 1) break;
		}
		else {
			break;
		}
	}
	for (int loop = 3; (long long)loop * (long long)loop <= N; loop += 2) {
		if (N % loop == 0) {
			N /= loop;
			re[loop]++;
			loop -= 2;
			if (N == 1) break;
		}
	}
	if (N > 1) re[N]++;
	return re;
}
long long gcd(long long num1, long long num2) {
	return num2 == 0 ? num1 : gcd(num2, num1 % num2);
}

struct Memo {
	long long fact = 0;
	long long fact_inv = 0;
	long long inv = 0;
};
class Combination1 {
private:
	long long m_module = 1000000007;
	vector<struct Memo> memo;
public:
	long long calculate(int, int);
	Combination1(int, long long);
};
long long Combination1::calculate(int n, int k) {
	return ((memo[n].fact * memo[k].fact_inv) % m_module * memo[n - k].fact_inv) % m_module;
}
Combination1::Combination1(int memo_max, long long module = 1000000007) {
	m_module = module;
	memo.push_back({ 1,1,0 });
	memo.push_back({ 1,1,1 });
	for (int loop = 2; loop <= memo_max; loop++) {
		struct Memo temp;
		temp.fact = (memo[loop - 1].fact * loop) % m_module;
		temp.inv = m_module - (memo[m_module % loop].inv * int(m_module / loop)) % m_module;
		temp.fact_inv = (memo[loop - 1].fact_inv * temp.inv) % m_module;
		memo.push_back(temp);
	}
}

class Combination2 {
private:
	int size = 0;
	bool add(int);
public:
	vector<int> sequence;
	bool next_combination(void);
	Combination2(int, int);
};
bool Combination2::add(int index) {
	if (index == (int)sequence.size() - 1 && sequence[index] == size - 1
		|| index < (int)sequence.size() - 1 && sequence[index] == sequence[index + 1] - 1) {
		if (index == 0) {
			return false;
		}
		else {
			bool re = add(index - 1);
			sequence[index] = sequence[index - 1] + 1;
			return re;
		}
	}
	else {
		sequence[index]++;
		return true;
	}
}
bool Combination2::next_combination(void) {
	return (sequence.size() == 0) ? false : add(sequence.size() - 1);
}
Combination2::Combination2(int n, int r) {
	size = n;
	for (int loop = 0; loop < r; loop++) sequence.push_back(loop);
	return;
}

void A_Sheep_and_Wolves(void) {

	int S, W; cin >> S >> W;

	cout << (S <= W ? "unsafe" : "safe") << endl;
	return;
}

void B_Battle(void) {

	int A, B, C, D; cin >> A >> B >> C >> D;

	while (1) {
		C -= B;
		if (C <= 0) {
			cout << "Yes" << endl;
			return;
		}
		A -= D;
		if (A <= 0) {
			cout << "No" << endl;
			return;
		}
	}
}

void C_gacha(void) {

	int N; cin >> N;
	map<string, int> collection;
	rep(loop, N) {
		string S; cin >> S;
		collection[S]++;
	}

	int counter = 0;
	for (auto loop = collection.begin(); loop != collection.end(); loop++) {
		counter++;
	}

	cout << counter << endl;
	return;
}

void D_Multiple_of_2019(void) {

	string S; cin >> S;

	int N = S.size();
	vector<int> sample(N);
	sample[0] = 1;
	for (int index = 1; index < N; index++) {
		sample[index] = (sample[index - 1] * 10) % 2019;
	}
	int rem = 0;
	array<int, 2019> counter = { 1 };
	for (int index = N - 1; index >= 0; index--) {
		rem = (rem + (int)(S[index] - '0') * sample[N - 1 - index]) % 2019;
		counter[rem]++;
	}
	long long sum = 0;
	for (int it : counter) {
		sum += it * (it - 1) / 2;
	}
	cout << sum;
	return;
}

int main(void) {

	cout << fixed << setprecision(15);

	//A_Sheep_and_Wolves();
	//B_Battle();
	//C_gacha();
	D_Multiple_of_2019();
	return 0;
}


Measured memory_bytes: 4448