Where Do Customers Live?

Whetcode Supply is choosing somewhere to put a second warehouse, and the shortlist starts from the simplest signal available: how many registered customers live in each city. Shipping costs fall fastest beside the biggest cluster, so the busiest city needs to be at the top of the list.

Three of the four cities have the same number of customers, so the list also needs a rule for what happens when two cities tie — otherwise the same query produces a different shortlist on different runs and nobody can tell which one they read last week.

customers — one row per registered customer. city is the city given at signup and signup_date is the day they registered, written year-month-day.

The table already exists in the database — there is nothing to create or load.

Task: Write a query returning two columns, city and n (how many registered customers give that city), one row per city that appears in the table, most customers first. When two cities have the same number, list them alphabetically by city. A city with no registered customers does not appear at all.

Example output — shape only, on invented cities. The second and third share a headcount, so they fall alphabetically: