{
 "cells": [
  {
   "cell_type": "code",
   "execution_count": 1,
   "metadata": {},
   "outputs": [],
   "source": [
    "from helpers_merging import *"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 4,
   "metadata": {},
   "outputs": [
    {
     "data": {
      "image/png": "[encoded data, 53092 characters]",
      "text/plain": [
       "<Figure size 1000x400 with 4 Axes>"
      ]
     },
     "metadata": {},
     "output_type": "display_data"
    },
    {
     "data": {
      "image/png": "[encoded data, 52644 characters]",
      "text/plain": [
       "<Figure size 1000x400 with 4 Axes>"
      ]
     },
     "metadata": {},
     "output_type": "display_data"
    },
    {
     "data": {
      "image/png": "[encoded data, 52088 characters]",
      "text/plain": [
       "<Figure size 1000x400 with 4 Axes>"
      ]
     },
     "metadata": {},
     "output_type": "display_data"
    },
    {
     "data": {
      "image/png": "[encoded data, 51728 characters]",
      "text/plain": [
       "<Figure size 1000x400 with 4 Axes>"
      ]
     },
     "metadata": {},
     "output_type": "display_data"
    }
   ],
   "source": [
    "paths = np.array([\"data/waist_ratio_1_highres.npz\",\n",
    "                  \"data/waist_ratio_1025.npz\",\n",
    "                  \"data/waist_ratio_105.npz\",\n",
    "                  \"data/waist_ratio_1075.npz\"])\n",
    "\n",
    "for path in paths:\n",
    "    data = np.load(path)\n",
    "\n",
    "    for key in data.keys():\n",
    "        globals()[key] = data[key]\n",
    "\n",
    "    # Create the figure and two subplots (2 rows, 1 column)\n",
    "    fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(10, 4))\n",
    "\n",
    "    # First plot (delta_power)\n",
    "    cax1 = ax1.imshow(np.where(delta_power!=0,delta_power,np.nan) / initial_powers[:, np.newaxis], \n",
    "                    extent=[np.min(initial_waists) / si.uW, np.max(initial_waists) / si.uW, \n",
    "                            np.min(initial_powers) / si.um, np.max(initial_powers) / si.um], \n",
    "                    origin=\"lower\", aspect=\"auto\",vmin=0.,vmax=0.21)\n",
    "    ax1.set_ylabel(\"Power (uW)\")\n",
    "    ax1.set_xlabel(\"Waist (um)\")\n",
    "    ax1.set_title(f\"Ratio of Tweezer Waists: {factor_waist2:.3f}\")\n",
    "    fig.colorbar(cax1, ax=ax1, label=\"Relative Power Sensitivity\")\n",
    "\n",
    "    # Second plot (delta_E_max)\n",
    "    cax2 = ax2.imshow(np.where(delta_E_max!=0,delta_E_max,np.nan), \n",
    "                    extent=[np.min(initial_waists) / si.uW, np.max(initial_waists) / si.uW, \n",
    "                            np.min(initial_powers) / si.um, np.max(initial_powers) / si.um], \n",
    "                    origin=\"lower\", aspect=\"auto\",vmin=0,vmax=2e-30)\n",
    "    ax2.set_ylabel(\"Power (uW)\")\n",
    "    ax2.set_xlabel(\"Waist (um)\")\n",
    "    ax2.set_title(f\"Ratio of Tweezer Waists: {factor_waist2:.3f}\")\n",
    "    fig.colorbar(cax2, ax=ax2, label=\"Energy Gap [a.u.]\")\n",
    "\n",
    "    # Adjust layout to prevent overlap\n",
    "    plt.tight_layout()\n",
    "\n",
    "    # Show the combined figure\n",
    "    plt.show()"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## Make high res plot for waist ratio of 1:"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 15,
   "metadata": {},
   "outputs": [],
   "source": [
    "from helpers_merging import *\n",
    "\n",
    "initial_power = 50* si.uW\n",
    "initial_waist = 1.1*si.uW\n",
    "initial_distance = 3*si.um\n",
    "\n",
    "trap: DoubleTweezer = DoubleTweezer(\n",
    "    power=0,  # Set pancake laser power to 0, no 2D trap\n",
    "    grad_z= 0*si.G/si.cm,\n",
    "    grad_r=0,\n",
    "    power_tweezer1 = initial_power,     #stationary\n",
    "    power_tweezer2 = initial_power,     #transfer tweezer\n",
    "    waist_tweezer1 = initial_waist,     #stationary\n",
    "    waist_tweezer2 = initial_waist*1.02,     #transfer tweezer\n",
    "    distance_tweezers = initial_distance,\n",
    "\n",
    "    a=180*(4 * np.pi * const.epsilon_0 * const.value(\"Bohr radius\")**3)/(2 * const.epsilon_0 * const.c),\n",
    "    wvl = 532 * si.nm,\n",
    "\n",
    "    g = 0,\n",
    ")\n",
    "\n",
    "x, y, z = trap.x, trap.y, trap.z"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": [
    "def get_deltaE(power_tweezer1, power_tweezer2, waist_tweezer1, waist_tweezer2,\n",
    "               n_levels=10,n_pot_steps=2000, initial_distance=4*si.um, plot=True):\n",
    "    \"\"\"\n",
    "    Returns the minimal energy gap and occupation numbers of the groundstate when the two tweezers merge.\n",
    "    \"\"\"\n",
    "    trap[trap.power_tweezer1] = power_tweezer1\n",
    "    trap[trap.power_tweezer2] = power_tweezer2\n",
    "    trap[trap.waist_tweezer1] = waist_tweezer1\n",
    "    trap[trap.waist_tweezer2] = waist_tweezer2\n",
    "\n",
    "    distances = np.linspace(initial_distance,0*si.um,500) #always has to have smallest distance at last index\n",
    "    energies, states, potentials = loop_distances(trap, distances,n_levels=n_levels,n_pot_steps=n_pot_steps)\n",
    "\n",
    "    new_energies, new_states, new_potentials, index_top, index, swap_index = swapped_loop_distance(distances, energies, states, potentials)\n",
    "    energies_left, energies_right, states_left, states_right = find_ass_tweezer(new_energies,new_states, return_deltaE=False)\n",
    "\n",
    "    if len(index)!=0:\n",
    "        deltaE_min = 0\n",
    "        print(\"crossover\")\n",
    "    else:\n",
    "        deltaE_min = np.inf\n",
    "        for i in range(energies_left.shape[1]):\n",
    "            for j in range(energies_right.shape[1]):\n",
    "                row_diff = np.nanmin(np.abs(energies_left[:,i] - energies_right[:,j]))\n",
    "                if row_diff<deltaE_min:\n",
    "                    deltaE_min = row_diff\n",
    "                    i_min, j_min = i,j\n",
    "        print(f\"closest approach between states: left:{i_min}, right:{j_min}\")\n",
    "\n",
    "    if plot:\n",
    "        # Create the figure with two subplots (1 row, 2 columns)\n",
    "        fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(8, 4))\n",
    "\n",
    "        # Plot the full range on ax1\n",
    "        \"\"\"\n",
    "        ax1.plot(distances/si.um, energies_left[:, 0], color=\"red\", label=\"GS left tweezer\")\n",
    "        ax1.plot(distances/si.um, energies_right[:, 0], color=\"blue\", label=\"GS right tweezer\")\n",
    "        ax1.plot(distances/si.um, energies_left[:, 1:], color=\"red\", linestyle=\"dotted\", label=\"left tweezer\")\n",
    "        ax1.plot(distances/si.um, energies_right[:, 1:], color=\"blue\", linestyle=\"dotted\", label=\"right tweezer\")\"\"\"\n",
    "        ax1.plot(distances/si.um, energies_left[:], color=\"red\", label=\"left tweezer\")\n",
    "        ax1.plot(distances/si.um, energies_right[:], color=\"blue\", label=\"right tweezer\")\n",
    "\n",
    "        for i, ind in enumerate(index):\n",
    "            ax1.axvline(distances[ind]/si.um, color=\"k\", alpha=0.7, label=\"energy crossings\")\n",
    "\n",
    "        ax1.set_xlabel(\"Tweezer distance [um]\")\n",
    "        ax1.set_ylabel(\"Eigenenergy [a.u.]\")\n",
    "        ax1.set_title(fr\"$p_l={float(trap.subs(trap.power_tweezer1))/si.uW:.1f}$ uW, $p_r={float(trap.subs(trap.power_tweezer2))/si.uW:.1f}$ uW, $w_l={float(trap.subs(trap.waist_tweezer1))/si.um:.3f}$ um, $w_r={float(trap.subs(trap.waist_tweezer2))/si.um:.3f}$ um\")\n",
    "        ax1.grid()\n",
    "\n",
    "        # Plot the zoomed-in range (1 to 1.5 µm) on ax2\n",
    "        \"\"\"\n",
    "        ax2.plot(distances/si.um, energies_left[:, 0], color=\"red\", label=\"GS left tweezer\")\n",
    "        ax2.plot(distances/si.um, energies_right[:, 0], color=\"blue\", label=\"GS right tweezer\")\n",
    "        ax2.plot(distances/si.um, energies_left[:, 1:], color=\"red\", linestyle=\"dotted\", label=\"left tweezer\")\n",
    "        ax2.plot(distances/si.um, energies_right[:, 1:], color=\"blue\", linestyle=\"dotted\", label=\"right tweezer\")\"\"\"\n",
    "        ax2.plot(distances/si.um, energies_left[:], color=\"red\", label=\"left tweezer\")\n",
    "        ax2.plot(distances/si.um, energies_right[:], color=\"blue\", label=\"right tweezer\")\n",
    "\n",
    "        for i, ind in enumerate(index):\n",
    "            ax2.axvline(distances[ind]/si.um, color=\"k\", alpha=0.7, label=\"energy crossings\")\n",
    "\n",
    "        ax2.set_xlabel(\"Tweezer distance [um]\")\n",
    "        ax2.set_ylabel(\"Eigenenergy [a.u.]\")\n",
    "        ax2.set_title(\"Zoomed-in Region\")\n",
    "        ax2.set_xlim(0.5*waist_tweezer1, 1.5*waist_tweezer1)  # Zooming in on the region between 1.0 and 1.5 µm\n",
    "        #ax2.set_ylim(-7e-28,-5e-28)\n",
    "        ax2.grid()\n",
    "\n",
    "        # Remove duplicates in the legend (labels that appear in both subplots)\n",
    "        handles, labels = ax1.get_legend_handles_labels()\n",
    "        unique_labels = dict(zip(labels, handles))  # Remove duplicates\n",
    "        ax1.legend(unique_labels.values(), unique_labels.keys())\n",
    "\n",
    "        # Show the plots\n",
    "        plt.tight_layout()\n",
    "        plt.show()\n",
    "\n",
    "    return deltaE_min"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 17,
   "metadata": {},
   "outputs": [],
   "source": [
    "def get_power_range(initial_power, initial_waist,factor_waist2, n_spacing=20,n_levels=10):\n",
    "    \"\"\"Calculates the range of powers where there occurs no level crossing.\"\"\"\n",
    "    level_spacings = np.linspace(0,1,n_spacing)\n",
    "    delta_E = np.full(len(level_spacings),np.nan)\n",
    "\n",
    "    trap[trap.power_tweezer1] = initial_power\n",
    "    trap[trap.waist_tweezer1] = initial_waist\n",
    "    trap[trap.waist_tweezer2] = initial_waist*factor_waist2\n",
    "\n",
    "    omega_r1 = sp.sqrt(2*trap.power_tweezer1*trap.a/sp.pi/trap.m)*2/trap.waist_tweezer1**2\n",
    "\n",
    "    #offset required for 1 level spacing of the left tweezer\n",
    "    power2_offset = sp.pi*trap.waist_tweezer2**2*const.hbar*omega_r1/2/trap.a\n",
    "\n",
    "    #factor to match trap depth and offset by half(or another fraction of) the level spacing\n",
    "    power2_factor = factor_waist2**2 - level_spacings*float(trap.subs(power2_offset))/initial_power\n",
    "\n",
    "    power2s = initial_power*power2_factor\n",
    "\n",
    "    for i, power2 in enumerate(power2s):\n",
    "        delta_E[i] = get_deltaE(initial_power,power2,initial_waist,initial_waist*factor_waist2,n_levels=n_levels,plot=False)\n",
    "\n",
    "    mask = delta_E != 0\n",
    "    if np.sum(mask) == 0:\n",
    "        power_range = 0\n",
    "    else:\n",
    "        power_range = np.max(power2s[mask]) - np.min(power2s[mask])\n",
    "    return power_range, np.nanmax(delta_E)"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": 18,
   "metadata": {},
   "outputs": [
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "crossover\n"
     ]
    },
    {
     "name": "stderr",
     "output_type": "stream",
     "text": [
      "C:\\Users\\naeve\\AppData\\Local\\Temp\\ipykernel_11984\\382801629.py:24: RuntimeWarning: All-NaN slice encountered\n",
      "  row_diff = np.nanmin(np.abs(energies_left[:,i] - energies_right[:,j]))\n"
     ]
    },
    {
     "name": "stdout",
     "output_type": "stream",
     "text": [
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "closest approach between states: left:2, right:1\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:1\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:2, right:2\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "closest approach between states: left:2, right:1\n",
      "crossover\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:3, right:3\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:4\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:0, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "closest approach between states: left:1, right:0\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "crossover\n",
      "closest approach between states: left:4, right:3\n"
     ]
    }
   ],
   "source": [
    "factor_waist2 = 1.0\n",
    "\n",
    "initial_powers = np.linspace(10,500,15)*si.uW\n",
    "initial_waists = np.linspace(0.7,2.2,6)*si.um\n",
    "delta_power = np.full((len(initial_powers),len(initial_waists)),np.nan)\n",
    "delta_E_max = np.full((len(initial_powers),len(initial_waists)),np.nan)\n",
    "\n",
    "for i, pow in enumerate(initial_powers):\n",
    "    for j, wai in enumerate(initial_waists):\n",
    "\n",
    "        delta_power[i,j], delta_E_max[i,j] = get_power_range(pow,wai,factor_waist2,n_spacing=25)\n",
    "\n",
    "np.savez('data/waist_ratio_1_highres.npz', initial_powers=initial_powers, initial_waists=initial_waists, delta_power=delta_power, delta_E_max=delta_E_max, factor_waist2=factor_waist2)\n"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": []
  }
 ],
 "metadata": {
  "kernelspec": {
   "display_name": "base",
   "language": "python",
   "name": "python3"
  },
  "language_info": {
   "codemirror_mode": {
    "name": "ipython",
    "version": 3
   },
   "file_extension": ".py",
   "mimetype": "text/x-python",
   "name": "python",
   "nbconvert_exporter": "python",
   "pygments_lexer": "ipython3",
   "version": "3.12.7"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 2
}
