n = int(input())
clock = [0] * 6
limit = [0] * 2

limit[0] = n // 10
limit[1] = n % 10

# 01 23 45

ret = 0

while True:
    clock[5] += 1
    if clock[5] == 10:
        clock[4] += 1
        clock[5] = 0
    if clock[4] == 6:
        clock[3] += 1
        clock[4] = 0
    if clock[3] == 10:
        clock[2] += 1
        clock[3] = 0
    if clock[2] == 6:
        clock[1] += 1
        clock[2] = 0
    if clock[1] == 10:
        clock[0] += 1
        clock[1] = 0
    if 3 in clock:
        ret += 1
    if clock[0] == limit[0] and clock[1] == limit[1]:
        if clock[2] == 5 and clock[3] == 9:
            if clock[4] == 5 and clock[5] == 9:
                break
print(ret)

# 파이썬
h = int(input())
count = 0

for i in range(h + 1):
	for i in range(60):
		for j in range(60):
			for k in range(60):
				if '3' in str(i) + str(j) + str(k):
					count += 1
print(count)

#include <bits/stdc++.h>

using namespace std;
int h, cnt;

bool check(int h, int m, int s)
{
	if (h % 10 == 3 || m / 10 == 3 || m % 10 == 3 || s / 10 == 3 || s % 10 == 3)
		return true;
	return false
}

int main(void)
{
	cin >> h;
	for (int i = 0; i <= h; i++)
	{
		for (int j = 0; j <= 60; j++)
		{
			for (int k = 0; k <= 60; j++)
			if (check(i, j, k)) cnt++;
		}
	}
	cout << cnt << '\n'
	return (0);
}

# chess
# 나동빈 15 - 2

pos = input()
pos_x = ["a", "b", "c", "d", "e", "f", "g", "h"]
pos_y = [1, 2, 3, 4, 5, 6, 7, 8]
cnt = 0

p_y = int(pos[1])
p_x = 0
n_x = 0
n_y = 0

mov_1 = [2, -2]
mov_2 = [1, -1]

for i in range(1, 8):
    if pos_x[i - 1] == pos[0]:
        p_x = i
        break

# print("current x : ", p_x, "current y : ", p_y)

for mov in mov_1:
    for mov2 in mov_2:
        n_x = mov + p_x
        n_y = mov2 + p_y
        # print(n_x, ", ", n_y)
        if n_x in range(1, 8) and n_y in range(1, 8):
            cnt += 1

for mov in mov_1:
    for mov2 in mov_2:
        n_y = mov + p_y
        n_x = mov2 + p_x
        # print(n_x, ", ", n_y)
        if n_x in range(1, 8) and n_y in range(1, 8):
            cnt += 1


print(cnt)

# 나이트의 현재 위치 입력 받기
input_data = intput()
row = int(input_data[1])
column = int(ord(input_data[0])) - int(ord'a') + 1

# 나이트가 이동할 수 있는 8가지 방향의 정의
steps = [(-2, -1), (-1, -2), (1, -2), (2, -1), (2, 1), (1, 2), (-1, 2), (-2, 1)]

# 8가지 방향에 대하여 각 위치로 이동이 가능한지 확인
result = 0
for step in steps:
	next_row = row + step[0]
	next_column = column + step[1]
	if next_row >= 1 and next_row <= 8 and next_column >= 1 and next_column <= 8:
		result += 1
print(result)

#include <bits/stdc++.h>

using namespace std;

string inputData;

int dx[] = {-2, -1, 1, 2, 2, 1, -1, -2}
int dy[] = {-1, -2, -2, -1, 1, 2, 2, 1}

int main(void)
{
	cin >> inputData;
	int row = inputData[1] - '0';
	int column = inputData[0] - 'a' + 1;

	int result = 0;
	for (int i = 0; i < 8; i++)
	{
		int nextRow = row + dx[i];
		int nextColumn = column + dy[i];
		if (nextRow >= 1 && nextRow <= 8 && nextColumn >= 1 && nextColumn <= 8)
			result += 1
	}
	cout << result << '\n'
	return (0);
}

# # chess
# 나동빈 15 - 3

str = input()

ret_num = 0
ret_str = []

for i in range(len(str)):
    if str[i] >= "1" and str[i] <= "9":
        ret_num += int(str[i])
    else:
        ret_str.append(str[i])
ret_str.sort()
print(*ret_str, sep="", end="")
if ret_num != 0:
    print(ret_num, end="")
print("\n")

# 초기 데이터 구조 작성
data = input()
result = []
value = 0

# 문자를 하나씩 확인
for x in data:
	if x.isalpha():
		result.append(x)
	else:
		value += int(x)
result.sort()
if value != 0:
	result.append(str(value))

print(''.join(result)) # 신기한 방법이다.

#include <bits/stdc++.h>

using namespace std;

string str;
vector<char> result;
int value = 0

int main(void)
{
	cin >> str;
	for (int i = 0; i < str.size(); i++)
	{
		if (isalpha(str[i]))
			result.push_back(str[i]);
		else
			value += str[i] - '0';
	}
	sort(result.begin(), result.end());
	for (int i = 0; i < result.size(); i++)
		cout << result[i]
	if (value != 0) cout << value
	cout << '\n'
}