def counting_kangaroos_is_fun():
sizes = []
for kangaroos in range(int(input())):
sizes.append(int(input()))
sizes.sort(reverse=True)
half_length = len(sizes) // 2 + (len(sizes) // 2 * 2 < len(sizes))
first_half, second_half = sizes[:half_length], sizes[half_length:]
visible = len(sizes)
a = 0
b = 0
while a < len(first_half) and b < len(second_half):
if first_half[a] / 2 >= second_half[b]:
visible -= 1
a += 1
b += 1
elif b < len(second_half):
b += 1
else:
break
print(visible)
counting_kangaroos_is_fun()
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |