import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}
} import java.util.*; util.* java public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	} main {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N =sc.nextInt(); N sc.nextInt() sc.nextInt sc int d[] = new int[N]; d new int[N] N for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			d[i] = sc.nextInt();
		} {
			d[i] = sc.nextInt();
		} d[i] = sc.nextInt() d[i] d i sc.nextInt() sc.nextInt sc int max; max for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		} {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		} for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			} int j = i; int j = i; j i j < N j N j++ j++ j {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			} {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			} if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				} d[i] < d[j] d[i] d i d[j] d j {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				} max = d[i] max d[i] d i d[i] = d[j] d[i] d i d[j] d j d[j] = max d[j] d j max int count = 1; count 1 int mochi = d[0]; mochi d[0] d 0 for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		} int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		} {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		} if(mochi > d[i]) {
				mochi = d[i];
				count++;
			} mochi > d[i] mochi d[i] d i {
				mochi = d[i];
				count++;
			} mochi = d[i] mochi d[i] d i count++ count System.out.println(count) System.out.println System.out System System.out count sc.close() sc.close sc String[] args args public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}
} public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}
} Main
import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//何枚持っているか
		int N =sc.nextInt();
		//各餅の直径
		int d[] = new int[N];
		for(int i = 0;i < N;i++) {
			d[i] = sc.nextInt();
		}
		//大きい順に並び替え
		int max;
		for(int i = 0;i < N;i++) {
			for(int j = i;j < N;j++) {
				if(d[i] < d[j]) {
					max = d[i];
					d[i] = d[j];
					d[j] = max;
				}
			}
		}
		//何段重ねにできるか(一段は確実にできる)
		int count = 1;
		//大きさの比較
		int mochi = d[0];
		for(int i = 1;i < N;i++) {
			if(mochi > d[i]) {
				mochi = d[i];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}
}