Canton of Boos

The Canton of Boos is a former canton situated in the Seine-Maritime département and in the Haute-Normandie region of northern France. It was disbanded following the French canton reorganisation which came into effect in March 2015.

Boos
Former canton
CountryFrance
RegionNormandy
DepartmentSeine-Maritime
No. of communes15
Disbanded2015
SeatBoos
Area
 • Total108.31 km2 (41.82 sq mi)
Population
 (1999)
 • Total35,567
 • Density328/km2 (850/sq mi)

Geography

An area of farming and light industry in the arrondissement of Rouen, centred on the town of Boos. The altitude varies from 2m (Les Authieux-sur-le-Port-Saint-Ouen) to 162m (Le Mesnil-Esnard) with an average altitude of 142m.

Composition

The Canton of Boos comprised 15 communes and a total of 35,567 inhabitants (census of 1999, without double counting).

CommuneInhabitantsPostal codeINSEE code
Amfreville-la-Mi-Voie28697692076005
Les Authieux-sur-le-Port-Saint-Ouen11747652076039
Belbeuf20327624076069
Bonsecours68537624076103
Boos28707652076116
Fresne-le-Plan4567652076285
Gouy7947652076313
Le Mesnil-Esnard64867624076429
Mesnil-Raoul7257652076434
Montmain14167652076448
La Neuville-Chant-d'Oisel17517652076464
Franqueville-Saint-Pierre50997652076475
Quévreville-la-Poterie9877652076514
Saint-Aubin-Celloville10157652076558
Ymare10407652076753

Population
Historical population of Canton of Boos
(Source: INSEE)
Year196219681975198219901999
Population147011637121066265243234835567
From the year 1962 on: No double counting—residents of multiple communes (e.g. students and military personnel) are counted only once.
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); sort(q, 8); printf("%s", q);}```
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); printf("%s", q);}```
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees" auto q = malloc(8); strcpy(q, s); printf("%s", q);}```

See also

Notes

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.