---
id: 5900f4d91000cf542c50ffea
challengeType: 5
title: 'Problem 364: Comfortable distance'
forumTopicId: 302025
---

## Description
<section id='description'>
There are N seats in a row. N people come after each other to fill the seats according to the following rules:
If there is any seat whose adjacent seat(s) are not occupied take such a seat.
If there is no such seat and there is any seat for which only one adjacent seat is occupied take such a seat.
Otherwise take one of the remaining available seats.

Let T(N) be the number of possibilities that N seats are occupied by N people with the given rules. The following figure shows T(4)=8.





We can verify that T(10) = 61632 and T(1 000) mod 100 000 007 = 47255094.
Find T(1 000 000) mod 100 000 007.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler364()</code> should return 44855254.
    testString: assert.strictEqual(euler364(), 44855254);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler364() {
  // Good luck!
  return true;
}

euler364();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>