import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	}

	/*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static double min(double d, double e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
}

class XY {
	int h;
	int c;

	XY(int h, int c) {
		this.h = h;
		this.c = c;
	}
} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	}

	/*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static double min(double d, double e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
} Main public static String Y = "Yes"; Y "Yes" public static String N = "No"; N "No" public static long MOD = (long) (Math.pow(10, 9) + 7); MOD (long) (Math.pow(10, 9) + 7) Math.pow(10, 9) Math.pow Math 10 9 7 public static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	} main {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	} long count = 1000000000000001l; count 1000000000000001l long n = nl() - 1l; n nl() - 1l nl() nl 1l String ans = ""; ans "" while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		} true {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		} if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			} n / 26l == 0 n / 26l n 26l 0 {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} char tmp = (char) ('a' + (char) (n % 26l)); tmp (char) ('a' + (char) (n % 26l)) 'a' (char) (n % 26l) n 26l ans += tmp ans tmp break; {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			} char tmp = (char) ('a' + (char) (n % 26l)); tmp (char) ('a' + (char) (n % 26l)) 'a' (char) (n % 26l) n 26l ans += tmp ans tmp n /= 26l n 26l n-- n StringBuilder sb = new StringBuilder(ans); sb new StringBuilder(ans) System.out.println(sb.reverse()) System.out.println System.out System System.out sb.reverse() sb.reverse sb String[] args args /*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	} sort {
		Arrays.sort(n);
		return n;
	} Arrays.sort(n) Arrays.sort Arrays n return n; n int[] n n static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	} sort {
		Arrays.sort(n);
		return n;
	} Arrays.sort(n) Arrays.sort Arrays n return n; n long[] n n static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	} ketasuu {
		String str = "" + n;
		return str.length();
	} String str = "" + n; str "" + n "" n return str.length(); str.length() str.length str int n n static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	} account {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	} String target = "AC"; target "AC" int count = 0; count 0 int len = str.length(); len str.length() str.length str for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		} int i = 0; int i = 0; i 0 i < len - 1 i len - 1 len 1 i++ i++ i {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		} {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		} if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			} target.equals(str.substring(i, i + target.length())) target.equals target str.substring(i, i + target.length()) str.substring str i i + target.length() i target.length() target.length target {
				count++;
			} count++ count return count; count String str str static int ni() {
		return sc.nextInt();
	} ni {
		return sc.nextInt();
	} return sc.nextInt(); sc.nextInt() sc.nextInt sc static long nl() {
		return sc.nextLong();
	} nl {
		return sc.nextLong();
	} return sc.nextLong(); sc.nextLong() sc.nextLong sc static double nd() {
		return sc.nextDouble();
	} nd {
		return sc.nextDouble();
	} return sc.nextDouble(); sc.nextDouble() sc.nextDouble sc static String n() {
		return sc.next();
	} n {
		return sc.next();
	} return sc.next(); sc.next() sc.next sc static char[] nc() {
		return sc.next().toCharArray();
	} nc {
		return sc.next().toCharArray();
	} return sc.next().toCharArray(); sc.next().toCharArray() sc.next().toCharArray sc.next() sc.next sc static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	} kaijo {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	} if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		} n == 0 || n == 1 n == 0 n 0 n == 1 n 1 {
			return 1;
		} return 1; 1 {
			return n * kaijo(n - 1);
		} return n * kaijo(n - 1); n * kaijo(n - 1) n kaijo(n - 1) kaijo n - 1 n 1 int n n static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	} fib {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	} return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1); (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1) (n == 1 || n == 0) n == 1 n 1 n == 0 n 0 n fib(n - 2) + fib(n - 1) fib(n - 2) fib n - 2 n 2 fib(n - 1) fib n - 1 n 1 int n n static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	} lcm {

		return m * n / gcd(m, n);
	} return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n long m m long n n static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	} lcm {

		return m * n / gcd(m, n);
	} return m * n / gcd(m, n); m * n / gcd(m, n) m * n m n gcd(m, n) gcd m n int m m int n n static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	} gcd {
		return (b == 0) ? a : gcd(b, a % b);
	} return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b long a a long b b static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	} gcd {
		return (b == 0) ? a : gcd(b, a % b);
	} return (b == 0) ? a : gcd(b, a % b); (b == 0) ? a : gcd(b, a % b) (b == 0) b 0 a gcd(b, a % b) gcd b a % b a b int a a int b b static void out(String info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info String info info static void out(int info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info int info info static void out(double info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info double info info static void out(long info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info long info info static void out(char info) {
		System.out.println(info);
	} out {
		System.out.println(info);
	} System.out.println(info) System.out.println System.out System System.out info char info info static void out(Object obj) {
		System.out.println(obj.toString());
	} out {
		System.out.println(obj.toString());
	} System.out.println(obj.toString()) System.out.println System.out System System.out obj.toString() obj.toString obj Object obj obj static void outn(String info) {
		System.out.print(info);
	} outn {
		System.out.print(info);
	} System.out.print(info) System.out.print System.out System System.out info String info info static void outn(int info) {
		System.out.print(info);
	} outn {
		System.out.print(info);
	} System.out.print(info) System.out.print System.out System System.out info int info info static void outn(double info) {
		System.out.print(info);
	} outn {
		System.out.print(info);
	} System.out.print(info) System.out.print System.out System System.out info double info info static void outn(long info) {
		System.out.print(info);
	} outn {
		System.out.print(info);
	} System.out.print(info) System.out.print System.out System System.out info long info info static void outn(char info) {
		System.out.print(info);
	} outn {
		System.out.print(info);
	} System.out.print(info) System.out.print System.out System System.out info char info info static double max(double d, double e) {
		return Math.max(d, e);
	} max {
		return Math.max(d, e);
	} return Math.max(d, e); Math.max(d, e) Math.max Math d e double d d double e e static long max(long a, long b) {
		return Math.max(a, b);
	} max {
		return Math.max(a, b);
	} return Math.max(a, b); Math.max(a, b) Math.max Math a b long a a long b b static double min(double d, double e) {
		return Math.min(d, e);
	} min {
		return Math.min(d, e);
	} return Math.min(d, e); Math.min(d, e) Math.min Math d e double d d double e e static int min(int a, int b) {
		return (int) Math.min(a, b);
	} min {
		return (int) Math.min(a, b);
	} return (int) Math.min(a, b); (int) Math.min(a, b) Math.min Math a b int a a int b b class XY {
	int h;
	int c;

	XY(int h, int c) {
		this.h = h;
		this.c = c;
	}
} XY int h; h int c; c XY(int h, int c) {
		this.h = h;
		this.c = c;
	} XY {
		this.h = h;
		this.c = c;
	} this.h = h this.h this this.h h this.c = c this.c this this.c c int h h int c c public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	}

	/*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static double min(double d, double e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
} public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	}

	/*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static double min(double d, double e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
} Main
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static String Y = "Yes";
	public static String N = "No";
	public static long MOD = (long) (Math.pow(10, 9) + 7);
	public static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		long count = 1000000000000001l;

		long n = nl() - 1l;
		String ans = "";
		while (true) {

			if (n / 26l == 0) {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				break;
			} else {
				char tmp = (char) ('a' + (char) (n % 26l));
				ans += tmp;
				n /= 26l;
			}
			n--;

		}

		StringBuilder sb = new StringBuilder(ans);
		System.out.println(sb.reverse());

	}

	/*
	 * 以下メソッド集
	 */
	static int[] sort(int[] n) {
		Arrays.sort(n);
		return n;
	}

	static long[] sort(long[] n) {
		Arrays.sort(n);
		return n;
	}

	static int ketasuu(int n) {
		String str = "" + n;
		return str.length();
	}

	static int account(String str) {
		String target = "AC";
		int count = 0;
		int len = str.length();
		for (int i = 0; i < len - 1; i++) {
			if (target.equals(str.substring(i, i + target.length()))) {
				count++;
			}
		}
		return count;
	}

	static int ni() {
		return sc.nextInt();
	}

	static long nl() {
		return sc.nextLong();
	}

	static double nd() {
		return sc.nextDouble();
	}

	static String n() {
		return sc.next();
	}

	static char[] nc() {
		return sc.next().toCharArray();
	}

	static int kaijo(int n) {
		if (n == 0 || n == 1) {
			return 1;
		} else {
			return n * kaijo(n - 1);
		}
	}

	static int fib(int n) {
		return (n == 1 || n == 0) ? n : fib(n - 2) + fib(n - 1);
	}

	static long lcm(long m, long n) {

		return m * n / gcd(m, n);
	}

	static int lcm(int m, int n) {

		return m * n / gcd(m, n);
	}

	static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static int gcd(int a, int b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static void out(String info) {
		System.out.println(info);
	}

	static void out(int info) {
		System.out.println(info);
	}

	static void out(double info) {
		System.out.println(info);
	}

	static void out(long info) {
		System.out.println(info);
	}

	static void out(char info) {
		System.out.println(info);
	}

	static void out(Object obj) {
		System.out.println(obj.toString());
	}

	static void outn(String info) {
		System.out.print(info);
	}

	static void outn(int info) {
		System.out.print(info);
	}

	static void outn(double info) {
		System.out.print(info);
	}

	static void outn(long info) {
		System.out.print(info);
	}

	static void outn(char info) {
		System.out.print(info);
	}

	static double max(double d, double e) {
		return Math.max(d, e);
	}

	static long max(long a, long b) {
		return Math.max(a, b);
	}

	static double min(double d, double e) {
		return Math.min(d, e);
	}

	static int min(int a, int b) {
		return (int) Math.min(a, b);
	}
}

class XY {
	int h;
	int c;

	XY(int h, int c) {
		this.h = h;
		this.c = c;
	}
}
