using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Atcoder
{
	class Program
	{
		static void Main(string[] args)
		{
			var N = int.Parse(Console.ReadLine());

			if (N < 357)
			{
				Console.Write("0");
			}
			int result = 0;
			for (int i = 357; i < N; i++)
			{
				if (i.ToString().Contains("0") || i.ToString().Contains("1") || i.ToString().Contains("2")
					|| i.ToString().Contains("4") || i.ToString().Contains("6") || i.ToString().Contains("8") || i.ToString().Contains("9"))
				{
					continue;
				}
				if (i.ToString().Contains("3") && i.ToString().Contains("5") && i.ToString().Contains("7"))
				{
					result++;
				}
			}
			Console.Write(result.ToString());
			//var N = int.Parse(firstLine[0]);
			//var K = int.Parse(firstLine[1]);

			//List<int> trees = new List<int>();
			//for (int i = 0; i < N; i++)
			//{
			//	trees.Add(int.Parse(Console.ReadLine()));
			//}
			//trees = trees.OrderBy(x => x).ToList();
			//var len = trees.Count;

			//List<int> difList = new List<int>();
			//difList.Add(0);
			//for (int i = 0; i < len-1; i++)
			//{
			//	difList.Add(trees[i + 1] - trees[i]);
			//}
			//difList = difList.OrderBy(x => x).ToList();

			//int result = 0;
			//for (int i = 0; i < K; i++)
			//{
			//	result += difList[i]; 
			//}

		}
	}
}
